./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_b03.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_b03.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 a9990c01c9a1f9597f7bc9fb384dfed8f76d280524d4aa5e1bce8b343e8f7c08 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 22:53:06,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 22:53:06,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 22:53:06,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 22:53:06,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 22:53:06,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 22:53:06,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 22:53:06,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 22:53:06,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 22:53:06,546 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 22:53:06,546 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 22:53:06,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 22:53:06,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 22:53:06,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 22:53:06,548 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 22:53:06,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 22:53:06,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 22:53:06,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 22:53:06,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 22:53:06,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 22:53:06,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 22:53:06,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 22:53:06,554 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 22:53:06,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 22:53:06,557 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 22:53:06,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 22:53:06,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 22:53:06,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 22:53:06,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 22:53:06,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:53:06,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 22:53:06,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 22:53:06,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 22:53:06,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 22:53:06,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 22:53:06,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 22:53:06,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 22:53:06,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 22:53:06,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 22:53:06,562 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 -> a9990c01c9a1f9597f7bc9fb384dfed8f76d280524d4aa5e1bce8b343e8f7c08 [2024-10-12 22:53:06,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 22:53:06,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 22:53:06,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 22:53:06,857 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 22:53:06,858 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 22:53:06,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c [2024-10-12 22:53:08,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 22:53:08,684 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 22:53:08,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c [2024-10-12 22:53:08,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6908d9edc/deafa51bf8bb4cbf8fba00a46678c3c2/FLAG3e9046635 [2024-10-12 22:53:08,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6908d9edc/deafa51bf8bb4cbf8fba00a46678c3c2 [2024-10-12 22:53:08,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 22:53:08,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 22:53:08,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 22:53:08,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 22:53:08,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 22:53:08,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:53:08" (1/1) ... [2024-10-12 22:53:08,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@303121b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:08, skipping insertion in model container [2024-10-12 22:53:08,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:53:08" (1/1) ... [2024-10-12 22:53:08,790 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 22:53:09,010 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_b03.c[1245,1258] [2024-10-12 22:53:09,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:53:09,312 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 22:53:09,323 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_b03.c[1245,1258] [2024-10-12 22:53:09,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:53:09,442 INFO L204 MainTranslator]: Completed translation [2024-10-12 22:53:09,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:09 WrapperNode [2024-10-12 22:53:09,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 22:53:09,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 22:53:09,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 22:53:09,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 22:53:09,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:53:09" (1/1) ... [2024-10-12 22:53:09,498 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:09" (1/1) ... [2024-10-12 22:53:09,717 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1909 [2024-10-12 22:53:09,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 22:53:09,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 22:53:09,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 22:53:09,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 22:53:09,731 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:09" (1/1) ... [2024-10-12 22:53:09,731 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:09" (1/1) ... [2024-10-12 22:53:09,763 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:09" (1/1) ... [2024-10-12 22:53:09,835 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-12 22:53:09,835 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:09" (1/1) ... [2024-10-12 22:53:09,835 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:09" (1/1) ... [2024-10-12 22:53:09,902 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:09" (1/1) ... [2024-10-12 22:53:09,914 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:09" (1/1) ... [2024-10-12 22:53:09,942 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:09" (1/1) ... [2024-10-12 22:53:09,959 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:09" (1/1) ... [2024-10-12 22:53:09,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 22:53:09,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 22:53:09,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 22:53:09,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 22:53:09,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:09" (1/1) ... [2024-10-12 22:53:09,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:53:10,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:53:10,027 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:10,030 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:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 22:53:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 22:53:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 22:53:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 22:53:10,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 22:53:10,367 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 22:53:10,372 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 22:53:12,002 INFO L? ?]: Removed 1250 outVars from TransFormulas that were not future-live. [2024-10-12 22:53:12,003 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 22:53:12,064 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 22:53:12,065 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 22:53:12,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:53:12 BoogieIcfgContainer [2024-10-12 22:53:12,065 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 22:53:12,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 22:53:12,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 22:53:12,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 22:53:12,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 10:53:08" (1/3) ... [2024-10-12 22:53:12,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666b7722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:53:12, skipping insertion in model container [2024-10-12 22:53:12,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:09" (2/3) ... [2024-10-12 22:53:12,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666b7722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:53:12, skipping insertion in model container [2024-10-12 22:53:12,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:53:12" (3/3) ... [2024-10-12 22:53:12,074 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b03.c [2024-10-12 22:53:12,091 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 22:53:12,092 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 22:53:12,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 22:53:12,169 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;@69c0db04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 22:53:12,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 22:53:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.5027624309392265) internal successors, (272), 182 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:12,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 22:53:12,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:12,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:12,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:12,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:12,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1886459951, now seen corresponding path program 1 times [2024-10-12 22:53:12,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:12,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677214692] [2024-10-12 22:53:12,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:12,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:13,042 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:13,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:13,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677214692] [2024-10-12 22:53:13,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677214692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:13,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:13,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:53:13,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517751513] [2024-10-12 22:53:13,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:13,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:53:13,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:13,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:53:13,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:53:13,084 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.5027624309392265) internal successors, (272), 182 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:13,165 INFO L93 Difference]: Finished difference Result 306 states and 456 transitions. [2024-10-12 22:53:13,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:53:13,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-12 22:53:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:13,182 INFO L225 Difference]: With dead ends: 306 [2024-10-12 22:53:13,182 INFO L226 Difference]: Without dead ends: 184 [2024-10-12 22:53:13,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:53:13,189 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 0 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:13,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 796 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:53:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-12 22:53:13,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-10-12 22:53:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 183 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 272 transitions. [2024-10-12 22:53:13,232 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 272 transitions. Word has length 56 [2024-10-12 22:53:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:13,233 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 272 transitions. [2024-10-12 22:53:13,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 272 transitions. [2024-10-12 22:53:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 22:53:13,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:13,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:13,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 22:53:13,236 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:13,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:13,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1647588172, now seen corresponding path program 1 times [2024-10-12 22:53:13,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:13,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107874191] [2024-10-12 22:53:13,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:13,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:53:13,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:13,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107874191] [2024-10-12 22:53:13,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107874191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:13,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:13,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:53:13,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887612409] [2024-10-12 22:53:13,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:13,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:53:13,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:13,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:53:13,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:53:13,502 INFO L87 Difference]: Start difference. First operand 184 states and 272 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:13,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:13,555 INFO L93 Difference]: Finished difference Result 309 states and 456 transitions. [2024-10-12 22:53:13,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:53:13,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-10-12 22:53:13,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:13,558 INFO L225 Difference]: With dead ends: 309 [2024-10-12 22:53:13,561 INFO L226 Difference]: Without dead ends: 186 [2024-10-12 22:53:13,562 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:13,563 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 0 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 793 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:13,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 793 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:13,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-12 22:53:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-10-12 22:53:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.481081081081081) internal successors, (274), 185 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 274 transitions. [2024-10-12 22:53:13,581 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 274 transitions. Word has length 57 [2024-10-12 22:53:13,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:13,581 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 274 transitions. [2024-10-12 22:53:13,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:13,581 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 274 transitions. [2024-10-12 22:53:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 22:53:13,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:13,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:13,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 22:53:13,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:13,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:13,584 INFO L85 PathProgramCache]: Analyzing trace with hash -633591384, now seen corresponding path program 1 times [2024-10-12 22:53:13,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:13,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593374306] [2024-10-12 22:53:13,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:13,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:14,631 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:14,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:14,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593374306] [2024-10-12 22:53:14,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593374306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:14,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:14,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:53:14,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871347937] [2024-10-12 22:53:14,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:14,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 22:53:14,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:14,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 22:53:14,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:53:14,634 INFO L87 Difference]: Start difference. First operand 186 states and 274 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:14,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:14,779 INFO L93 Difference]: Finished difference Result 318 states and 468 transitions. [2024-10-12 22:53:14,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 22:53:14,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-12 22:53:14,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:14,787 INFO L225 Difference]: With dead ends: 318 [2024-10-12 22:53:14,787 INFO L226 Difference]: Without dead ends: 193 [2024-10-12 22:53:14,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-12 22:53:14,789 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 233 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:14,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1295 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:53:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-12 22:53:14,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2024-10-12 22:53:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.4712041884816753) internal successors, (281), 191 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 281 transitions. [2024-10-12 22:53:14,812 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 281 transitions. Word has length 58 [2024-10-12 22:53:14,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:14,812 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 281 transitions. [2024-10-12 22:53:14,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 281 transitions. [2024-10-12 22:53:14,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 22:53:14,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:14,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:14,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 22:53:14,815 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:14,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:14,816 INFO L85 PathProgramCache]: Analyzing trace with hash -896918281, now seen corresponding path program 1 times [2024-10-12 22:53:14,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:14,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882822554] [2024-10-12 22:53:14,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:14,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:15,816 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:15,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:15,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882822554] [2024-10-12 22:53:15,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882822554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:15,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:15,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 22:53:15,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650578048] [2024-10-12 22:53:15,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:15,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 22:53:15,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:15,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 22:53:15,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 22:53:15,818 INFO L87 Difference]: Start difference. First operand 192 states and 281 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:16,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:16,020 INFO L93 Difference]: Finished difference Result 339 states and 495 transitions. [2024-10-12 22:53:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 22:53:16,020 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-12 22:53:16,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:16,022 INFO L225 Difference]: With dead ends: 339 [2024-10-12 22:53:16,022 INFO L226 Difference]: Without dead ends: 208 [2024-10-12 22:53:16,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-10-12 22:53:16,026 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 270 mSDsluCounter, 1799 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 2058 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:16,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 2058 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:53:16,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-12 22:53:16,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2024-10-12 22:53:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.4679802955665024) internal successors, (298), 203 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 298 transitions. [2024-10-12 22:53:16,041 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 298 transitions. Word has length 59 [2024-10-12 22:53:16,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:16,042 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 298 transitions. [2024-10-12 22:53:16,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:16,045 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 298 transitions. [2024-10-12 22:53:16,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 22:53:16,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:16,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:16,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 22:53:16,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:16,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:16,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1378210856, now seen corresponding path program 1 times [2024-10-12 22:53:16,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:16,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812836158] [2024-10-12 22:53:16,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:16,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:16,479 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:16,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:16,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812836158] [2024-10-12 22:53:16,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812836158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:16,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:16,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 22:53:16,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016632329] [2024-10-12 22:53:16,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:16,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:53:16,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:16,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:53:16,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:53:16,485 INFO L87 Difference]: Start difference. First operand 204 states and 298 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:16,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:16,610 INFO L93 Difference]: Finished difference Result 363 states and 529 transitions. [2024-10-12 22:53:16,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 22:53:16,611 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-12 22:53:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:16,612 INFO L225 Difference]: With dead ends: 363 [2024-10-12 22:53:16,612 INFO L226 Difference]: Without dead ends: 218 [2024-10-12 22:53:16,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-12 22:53:16,615 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 252 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:16,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1560 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:53:16,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-12 22:53:16,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-10-12 22:53:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.456221198156682) internal successors, (316), 217 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:16,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 316 transitions. [2024-10-12 22:53:16,634 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 316 transitions. Word has length 60 [2024-10-12 22:53:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:16,634 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 316 transitions. [2024-10-12 22:53:16,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 316 transitions. [2024-10-12 22:53:16,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 22:53:16,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:16,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:16,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 22:53:16,636 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:16,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:16,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1783143103, now seen corresponding path program 1 times [2024-10-12 22:53:16,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:16,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668029416] [2024-10-12 22:53:16,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:16,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:16,865 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:16,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:16,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668029416] [2024-10-12 22:53:16,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668029416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:16,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:16,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:53:16,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731157118] [2024-10-12 22:53:16,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:16,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:53:16,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:16,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:53:16,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:53:16,870 INFO L87 Difference]: Start difference. First operand 218 states and 316 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:16,942 INFO L93 Difference]: Finished difference Result 456 states and 652 transitions. [2024-10-12 22:53:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:53:16,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-12 22:53:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:16,945 INFO L225 Difference]: With dead ends: 456 [2024-10-12 22:53:16,945 INFO L226 Difference]: Without dead ends: 297 [2024-10-12 22:53:16,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:53:16,947 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 367 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 775 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:16,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 775 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:16,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-12 22:53:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 249. [2024-10-12 22:53:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.4435483870967742) internal successors, (358), 248 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:16,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 358 transitions. [2024-10-12 22:53:16,955 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 358 transitions. Word has length 60 [2024-10-12 22:53:16,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:16,955 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 358 transitions. [2024-10-12 22:53:16,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 358 transitions. [2024-10-12 22:53:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 22:53:16,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:16,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:16,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 22:53:16,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:16,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:16,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1875315468, now seen corresponding path program 1 times [2024-10-12 22:53:16,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:16,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340851520] [2024-10-12 22:53:16,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:16,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:17,160 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:17,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:17,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340851520] [2024-10-12 22:53:17,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340851520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:17,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:17,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:53:17,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809742709] [2024-10-12 22:53:17,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:17,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:53:17,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:17,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:53:17,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:53:17,162 INFO L87 Difference]: Start difference. First operand 249 states and 358 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:17,233 INFO L93 Difference]: Finished difference Result 455 states and 647 transitions. [2024-10-12 22:53:17,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:53:17,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-12 22:53:17,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:17,235 INFO L225 Difference]: With dead ends: 455 [2024-10-12 22:53:17,235 INFO L226 Difference]: Without dead ends: 281 [2024-10-12 22:53:17,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:53:17,237 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 365 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 775 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:17,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 775 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:17,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-12 22:53:17,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 235. [2024-10-12 22:53:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.4401709401709402) internal successors, (337), 234 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 337 transitions. [2024-10-12 22:53:17,244 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 337 transitions. Word has length 60 [2024-10-12 22:53:17,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:17,245 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 337 transitions. [2024-10-12 22:53:17,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:17,245 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 337 transitions. [2024-10-12 22:53:17,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 22:53:17,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:17,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:17,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 22:53:17,246 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:17,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:17,247 INFO L85 PathProgramCache]: Analyzing trace with hash -177880731, now seen corresponding path program 1 times [2024-10-12 22:53:17,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:17,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068848520] [2024-10-12 22:53:17,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:17,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:17,907 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:17,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:17,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068848520] [2024-10-12 22:53:17,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068848520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:17,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:17,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 22:53:17,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562109386] [2024-10-12 22:53:17,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:17,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 22:53:17,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:17,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 22:53:17,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-12 22:53:17,910 INFO L87 Difference]: Start difference. First operand 235 states and 337 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:18,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:18,067 INFO L93 Difference]: Finished difference Result 416 states and 595 transitions. [2024-10-12 22:53:18,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 22:53:18,068 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-12 22:53:18,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:18,071 INFO L225 Difference]: With dead ends: 416 [2024-10-12 22:53:18,072 INFO L226 Difference]: Without dead ends: 259 [2024-10-12 22:53:18,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-12 22:53:18,073 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 249 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:18,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 2078 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:53:18,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-12 22:53:18,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 253. [2024-10-12 22:53:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.4325396825396826) internal successors, (361), 252 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 361 transitions. [2024-10-12 22:53:18,084 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 361 transitions. Word has length 61 [2024-10-12 22:53:18,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:18,085 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 361 transitions. [2024-10-12 22:53:18,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:18,086 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 361 transitions. [2024-10-12 22:53:18,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 22:53:18,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:18,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:18,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 22:53:18,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:18,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:18,089 INFO L85 PathProgramCache]: Analyzing trace with hash -573573140, now seen corresponding path program 1 times [2024-10-12 22:53:18,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:18,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767353383] [2024-10-12 22:53:18,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:18,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:18,272 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:18,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:18,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767353383] [2024-10-12 22:53:18,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767353383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:18,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:18,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:53:18,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777962389] [2024-10-12 22:53:18,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:18,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:53:18,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:18,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:53:18,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:53:18,275 INFO L87 Difference]: Start difference. First operand 253 states and 361 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:18,344 INFO L93 Difference]: Finished difference Result 472 states and 667 transitions. [2024-10-12 22:53:18,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:53:18,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-12 22:53:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:18,349 INFO L225 Difference]: With dead ends: 472 [2024-10-12 22:53:18,349 INFO L226 Difference]: Without dead ends: 287 [2024-10-12 22:53:18,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:53:18,350 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 343 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 775 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:18,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 775 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:18,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-12 22:53:18,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 243. [2024-10-12 22:53:18,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 1.4338842975206612) internal successors, (347), 242 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 347 transitions. [2024-10-12 22:53:18,361 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 347 transitions. Word has length 61 [2024-10-12 22:53:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:18,361 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 347 transitions. [2024-10-12 22:53:18,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 347 transitions. [2024-10-12 22:53:18,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 22:53:18,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:18,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:18,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 22:53:18,362 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:18,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:18,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1430893704, now seen corresponding path program 1 times [2024-10-12 22:53:18,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:18,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756980023] [2024-10-12 22:53:18,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:18,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:19,124 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,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:19,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756980023] [2024-10-12 22:53:19,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756980023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:19,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:19,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-12 22:53:19,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975841338] [2024-10-12 22:53:19,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:19,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 22:53:19,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:19,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 22:53:19,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-12 22:53:19,127 INFO L87 Difference]: Start difference. First operand 243 states and 347 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:19,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:19,342 INFO L93 Difference]: Finished difference Result 429 states and 612 transitions. [2024-10-12 22:53:19,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 22:53:19,343 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-12 22:53:19,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:19,344 INFO L225 Difference]: With dead ends: 429 [2024-10-12 22:53:19,344 INFO L226 Difference]: Without dead ends: 256 [2024-10-12 22:53:19,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-12 22:53:19,345 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 256 mSDsluCounter, 2540 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:19,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 2796 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 22:53:19,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-12 22:53:19,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 251. [2024-10-12 22:53:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.432) internal successors, (358), 250 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 358 transitions. [2024-10-12 22:53:19,352 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 358 transitions. Word has length 62 [2024-10-12 22:53:19,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:19,353 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 358 transitions. [2024-10-12 22:53:19,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 358 transitions. [2024-10-12 22:53:19,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 22:53:19,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:19,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:19,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 22:53:19,354 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:19,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:19,355 INFO L85 PathProgramCache]: Analyzing trace with hash 775235404, now seen corresponding path program 1 times [2024-10-12 22:53:19,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:19,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743339105] [2024-10-12 22:53:19,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:19,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:20,051 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:20,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:20,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743339105] [2024-10-12 22:53:20,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743339105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:20,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:20,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-12 22:53:20,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262612434] [2024-10-12 22:53:20,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:20,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 22:53:20,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:20,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 22:53:20,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-12 22:53:20,054 INFO L87 Difference]: Start difference. First operand 251 states and 358 transitions. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:20,401 INFO L93 Difference]: Finished difference Result 458 states and 652 transitions. [2024-10-12 22:53:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 22:53:20,402 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-12 22:53:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:20,404 INFO L225 Difference]: With dead ends: 458 [2024-10-12 22:53:20,405 INFO L226 Difference]: Without dead ends: 277 [2024-10-12 22:53:20,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-10-12 22:53:20,406 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 256 mSDsluCounter, 3234 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 3485 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:20,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 3485 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:53:20,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-12 22:53:20,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 270. [2024-10-12 22:53:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.4312267657992566) internal successors, (385), 269 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:20,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 385 transitions. [2024-10-12 22:53:20,416 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 385 transitions. Word has length 62 [2024-10-12 22:53:20,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:20,417 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 385 transitions. [2024-10-12 22:53:20,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:20,417 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 385 transitions. [2024-10-12 22:53:20,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 22:53:20,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:20,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:20,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 22:53:20,418 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:20,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:20,419 INFO L85 PathProgramCache]: Analyzing trace with hash 920405523, now seen corresponding path program 1 times [2024-10-12 22:53:20,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:20,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482918480] [2024-10-12 22:53:20,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:20,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:20,595 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:20,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:20,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482918480] [2024-10-12 22:53:20,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482918480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:20,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:20,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:53:20,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260704422] [2024-10-12 22:53:20,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:20,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:53:20,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:20,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:53:20,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:53:20,597 INFO L87 Difference]: Start difference. First operand 270 states and 385 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:20,666 INFO L93 Difference]: Finished difference Result 517 states and 729 transitions. [2024-10-12 22:53:20,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:53:20,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-12 22:53:20,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:20,668 INFO L225 Difference]: With dead ends: 517 [2024-10-12 22:53:20,668 INFO L226 Difference]: Without dead ends: 317 [2024-10-12 22:53:20,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:53:20,669 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 316 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 775 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:20,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 775 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:20,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-12 22:53:20,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 289. [2024-10-12 22:53:20,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.4166666666666667) internal successors, (408), 288 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:20,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 408 transitions. [2024-10-12 22:53:20,681 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 408 transitions. Word has length 62 [2024-10-12 22:53:20,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:20,681 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 408 transitions. [2024-10-12 22:53:20,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:20,681 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 408 transitions. [2024-10-12 22:53:20,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 22:53:20,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:20,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:20,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 22:53:20,683 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:20,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:20,683 INFO L85 PathProgramCache]: Analyzing trace with hash -85644059, now seen corresponding path program 1 times [2024-10-12 22:53:20,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:20,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603001075] [2024-10-12 22:53:20,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:20,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:20,920 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:20,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:20,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603001075] [2024-10-12 22:53:20,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603001075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:20,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:20,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:53:20,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408571083] [2024-10-12 22:53:20,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:20,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:53:20,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:20,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:53:20,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:53:20,924 INFO L87 Difference]: Start difference. First operand 289 states and 408 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:20,998 INFO L93 Difference]: Finished difference Result 521 states and 731 transitions. [2024-10-12 22:53:20,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:53:20,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-12 22:53:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:21,000 INFO L225 Difference]: With dead ends: 521 [2024-10-12 22:53:21,000 INFO L226 Difference]: Without dead ends: 309 [2024-10-12 22:53:21,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:53:21,002 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 311 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 775 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:21,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 775 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:53:21,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-12 22:53:21,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2024-10-12 22:53:21,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.4148936170212767) internal successors, (399), 282 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 399 transitions. [2024-10-12 22:53:21,011 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 399 transitions. Word has length 62 [2024-10-12 22:53:21,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:21,011 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 399 transitions. [2024-10-12 22:53:21,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:21,012 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 399 transitions. [2024-10-12 22:53:21,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 22:53:21,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:21,013 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:21,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 22:53:21,013 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:21,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:21,014 INFO L85 PathProgramCache]: Analyzing trace with hash -9018232, now seen corresponding path program 1 times [2024-10-12 22:53:21,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:21,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036630959] [2024-10-12 22:53:21,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:21,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:21,358 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:21,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:21,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036630959] [2024-10-12 22:53:21,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036630959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:21,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:21,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:53:21,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557930609] [2024-10-12 22:53:21,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:21,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:53:21,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:21,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:53:21,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:53:21,360 INFO L87 Difference]: Start difference. First operand 283 states and 399 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:21,406 INFO L93 Difference]: Finished difference Result 487 states and 691 transitions. [2024-10-12 22:53:21,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:53:21,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-12 22:53:21,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:21,408 INFO L225 Difference]: With dead ends: 487 [2024-10-12 22:53:21,408 INFO L226 Difference]: Without dead ends: 284 [2024-10-12 22:53:21,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:21,409 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 229 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:21,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 789 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:53:21,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-12 22:53:21,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-10-12 22:53:21,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.4134275618374559) internal successors, (400), 283 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 400 transitions. [2024-10-12 22:53:21,415 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 400 transitions. Word has length 63 [2024-10-12 22:53:21,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:21,416 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 400 transitions. [2024-10-12 22:53:21,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 400 transitions. [2024-10-12 22:53:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 22:53:21,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:21,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:21,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 22:53:21,417 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:21,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:21,418 INFO L85 PathProgramCache]: Analyzing trace with hash -172960813, now seen corresponding path program 1 times [2024-10-12 22:53:21,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:21,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744498759] [2024-10-12 22:53:21,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:21,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 22:53:21,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 22:53:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 22:53:21,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 22:53:21,601 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 22:53:21,603 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 22:53:21,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 22:53:21,608 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:21,711 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 22:53:21,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 10:53:21 BoogieIcfgContainer [2024-10-12 22:53:21,717 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 22:53:21,717 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 22:53:21,718 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 22:53:21,718 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 22:53:21,719 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:12" (3/4) ... [2024-10-12 22:53:21,721 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 22:53:21,723 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 22:53:21,724 INFO L158 Benchmark]: Toolchain (without parser) took 13007.07ms. Allocated memory was 176.2MB in the beginning and 580.9MB in the end (delta: 404.8MB). Free memory was 115.9MB in the beginning and 287.5MB in the end (delta: -171.6MB). Peak memory consumption was 234.4MB. Max. memory is 16.1GB. [2024-10-12 22:53:21,724 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 176.2MB. Free memory was 139.7MB in the beginning and 139.5MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 22:53:21,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 724.81ms. Allocated memory is still 176.2MB. Free memory was 115.9MB in the beginning and 66.2MB in the end (delta: 49.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-10-12 22:53:21,725 INFO L158 Benchmark]: Boogie Procedure Inliner took 273.74ms. Allocated memory was 176.2MB in the beginning and 257.9MB in the end (delta: 81.8MB). Free memory was 66.2MB in the beginning and 203.2MB in the end (delta: -137.0MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2024-10-12 22:53:21,726 INFO L158 Benchmark]: Boogie Preprocessor took 268.57ms. Allocated memory is still 257.9MB. Free memory was 203.2MB in the beginning and 179.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-12 22:53:21,726 INFO L158 Benchmark]: RCFGBuilder took 2076.65ms. Allocated memory is still 257.9MB. Free memory was 179.1MB in the beginning and 157.1MB in the end (delta: 22.0MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. [2024-10-12 22:53:21,727 INFO L158 Benchmark]: TraceAbstraction took 9649.56ms. Allocated memory was 257.9MB in the beginning and 580.9MB in the end (delta: 323.0MB). Free memory was 156.0MB in the beginning and 287.5MB in the end (delta: -131.5MB). Peak memory consumption was 190.4MB. Max. memory is 16.1GB. [2024-10-12 22:53:21,727 INFO L158 Benchmark]: Witness Printer took 6.31ms. Allocated memory is still 580.9MB. Free memory is still 287.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 22:53:21,729 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.30ms. Allocated memory is still 176.2MB. Free memory was 139.7MB in the beginning and 139.5MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 724.81ms. Allocated memory is still 176.2MB. Free memory was 115.9MB in the beginning and 66.2MB in the end (delta: 49.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 273.74ms. Allocated memory was 176.2MB in the beginning and 257.9MB in the end (delta: 81.8MB). Free memory was 66.2MB in the beginning and 203.2MB in the end (delta: -137.0MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 268.57ms. Allocated memory is still 257.9MB. Free memory was 203.2MB in the beginning and 179.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2076.65ms. Allocated memory is still 257.9MB. Free memory was 179.1MB in the beginning and 157.1MB in the end (delta: 22.0MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9649.56ms. Allocated memory was 257.9MB in the beginning and 580.9MB in the end (delta: 323.0MB). Free memory was 156.0MB in the beginning and 287.5MB in the end (delta: -131.5MB). Peak memory consumption was 190.4MB. Max. memory is 16.1GB. * Witness Printer took 6.31ms. Allocated memory is still 580.9MB. Free memory is still 287.5MB. 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 375. 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_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 4); [L30] const SORT_7 msb_SORT_7 = (SORT_7)1 << (4 - 1); [L32] const SORT_11 mask_SORT_11 = (SORT_11)-1 >> (sizeof(SORT_11) * 8 - 32); [L33] const SORT_11 msb_SORT_11 = (SORT_11)1 << (32 - 1); [L35] const SORT_37 mask_SORT_37 = (SORT_37)-1 >> (sizeof(SORT_37) * 8 - 3); [L36] const SORT_37 msb_SORT_37 = (SORT_37)1 << (3 - 1); [L38] const SORT_67 mask_SORT_67 = (SORT_67)-1 >> (sizeof(SORT_67) * 8 - 2); [L39] const SORT_67 msb_SORT_67 = (SORT_67)1 << (2 - 1); [L41] const SORT_7 var_8 = 0; [L42] const SORT_11 var_13 = 0; [L43] const SORT_11 var_16 = 8; [L44] const SORT_11 var_20 = 4; [L45] const SORT_11 var_24 = 2; [L46] const SORT_11 var_28 = 1; [L47] const SORT_1 var_33 = 1; [L48] const SORT_37 var_38 = 0; [L49] const SORT_1 var_47 = 0; [L50] const SORT_67 var_68 = 0; [L51] const SORT_67 var_71 = 1; [L52] const SORT_37 var_81 = 7; [L53] const SORT_37 var_104 = 1; [L54] const SORT_37 var_123 = 2; [L55] const SORT_37 var_138 = 4; [L56] const SORT_67 var_154 = 2; [L57] const SORT_7 var_394 = 8; [L58] const SORT_7 var_397 = 4; [L59] const SORT_7 var_400 = 2; [L60] const SORT_7 var_401 = 1; [L62] SORT_1 input_2; [L63] SORT_1 input_3; [L64] SORT_1 input_4; [L65] SORT_1 input_5; [L66] SORT_1 input_6; [L67] SORT_37 input_75; [L68] SORT_37 input_76; [L69] SORT_37 input_77; [L70] SORT_37 input_78; [L71] SORT_37 input_79; [L72] SORT_37 input_80; [L73] SORT_37 input_85; [L74] SORT_37 input_87; [L75] SORT_37 input_89; [L76] SORT_37 input_94; [L77] SORT_37 input_96; [L78] SORT_37 input_98; [L79] SORT_37 input_102; [L80] SORT_37 input_103; [L81] SORT_37 input_108; [L82] SORT_37 input_110; [L83] SORT_37 input_115; [L84] SORT_37 input_117; [L85] SORT_37 input_121; [L86] SORT_37 input_122; [L87] SORT_37 input_127; [L88] SORT_37 input_132; [L89] SORT_37 input_136; [L90] SORT_37 input_137; [L91] SORT_37 input_149; [L92] SORT_37 input_160; [L93] SORT_37 input_161; [L94] SORT_37 input_162; [L95] SORT_37 input_163; [L96] SORT_37 input_164; [L97] SORT_37 input_165; [L98] SORT_37 input_168; [L99] SORT_37 input_170; [L100] SORT_37 input_172; [L101] SORT_37 input_177; [L102] SORT_37 input_179; [L103] SORT_37 input_181; [L104] SORT_37 input_185; [L105] SORT_37 input_186; [L106] SORT_37 input_189; [L107] SORT_37 input_191; [L108] SORT_37 input_196; [L109] SORT_37 input_198; [L110] SORT_37 input_202; [L111] SORT_37 input_203; [L112] SORT_37 input_206; [L113] SORT_37 input_211; [L114] SORT_37 input_215; [L115] SORT_37 input_216; [L116] SORT_37 input_226; [L117] SORT_37 input_233; [L118] SORT_37 input_234; [L119] SORT_37 input_235; [L120] SORT_37 input_236; [L121] SORT_37 input_237; [L122] SORT_37 input_238; [L123] SORT_37 input_241; [L124] SORT_37 input_243; [L125] SORT_37 input_245; [L126] SORT_37 input_250; [L127] SORT_37 input_252; [L128] SORT_37 input_254; [L129] SORT_37 input_258; [L130] SORT_37 input_259; [L131] SORT_37 input_262; [L132] SORT_37 input_264; [L133] SORT_37 input_269; [L134] SORT_37 input_271; [L135] SORT_37 input_275; [L136] SORT_37 input_276; [L137] SORT_37 input_279; [L138] SORT_37 input_284; [L139] SORT_37 input_288; [L140] SORT_37 input_289; [L141] SORT_37 input_299; [L142] SORT_37 input_306; [L143] SORT_37 input_307; [L144] SORT_37 input_308; [L145] SORT_37 input_309; [L146] SORT_37 input_310; [L147] SORT_37 input_311; [L148] SORT_37 input_314; [L149] SORT_37 input_316; [L150] SORT_37 input_318; [L151] SORT_37 input_323; [L152] SORT_37 input_325; [L153] SORT_37 input_327; [L154] SORT_37 input_331; [L155] SORT_37 input_332; [L156] SORT_37 input_335; [L157] SORT_37 input_337; [L158] SORT_37 input_342; [L159] SORT_37 input_344; [L160] SORT_37 input_348; [L161] SORT_37 input_349; [L162] SORT_37 input_352; [L163] SORT_37 input_357; [L164] SORT_37 input_361; [L165] SORT_37 input_362; [L166] SORT_37 input_372; [L167] SORT_7 input_391; [L168] SORT_7 input_392; [L169] SORT_7 input_393; [L171] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L171] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L172] EXPR __VERIFIER_nondet_uchar() & mask_SORT_37 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L172] SORT_37 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_37; [L173] EXPR __VERIFIER_nondet_uchar() & mask_SORT_37 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L173] SORT_37 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_37; [L174] EXPR __VERIFIER_nondet_uchar() & mask_SORT_37 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L174] SORT_37 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_37; [L175] EXPR __VERIFIER_nondet_uchar() & mask_SORT_37 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L175] SORT_37 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_37; [L176] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L176] SORT_1 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L177] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L177] SORT_1 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L178] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L178] SORT_1 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L179] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L179] SORT_1 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L180] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L180] SORT_7 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L181] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L181] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L182] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L182] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L183] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L183] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L184] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L184] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L185] EXPR __VERIFIER_nondet_uchar() & mask_SORT_67 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L185] SORT_67 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_67; [L187] SORT_7 init_10_arg_1 = var_8; [L188] state_9 = init_10_arg_1 [L189] SORT_37 init_40_arg_1 = var_38; [L190] state_39 = init_40_arg_1 [L191] SORT_37 init_42_arg_1 = var_38; [L192] state_41 = init_42_arg_1 [L193] SORT_37 init_44_arg_1 = var_38; [L194] state_43 = init_44_arg_1 [L195] SORT_37 init_46_arg_1 = var_38; [L196] state_45 = init_46_arg_1 [L197] SORT_1 init_49_arg_1 = var_47; [L198] state_48 = init_49_arg_1 [L199] SORT_1 init_51_arg_1 = var_47; [L200] state_50 = init_51_arg_1 [L201] SORT_1 init_53_arg_1 = var_47; [L202] state_52 = init_53_arg_1 [L203] SORT_1 init_55_arg_1 = var_47; [L204] state_54 = init_55_arg_1 [L205] SORT_7 init_57_arg_1 = var_8; [L206] state_56 = init_57_arg_1 [L207] SORT_1 init_60_arg_1 = var_47; [L208] state_59 = init_60_arg_1 [L209] SORT_1 init_62_arg_1 = var_47; [L210] state_61 = init_62_arg_1 [L211] SORT_1 init_64_arg_1 = var_47; [L212] state_63 = init_64_arg_1 [L213] SORT_1 init_66_arg_1 = var_47; [L214] state_65 = init_66_arg_1 [L215] SORT_67 init_70_arg_1 = var_68; [L216] state_69 = init_70_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L219] input_2 = __VERIFIER_nondet_uchar() [L220] input_3 = __VERIFIER_nondet_uchar() [L221] input_4 = __VERIFIER_nondet_uchar() [L222] input_5 = __VERIFIER_nondet_uchar() [L223] input_6 = __VERIFIER_nondet_uchar() [L224] input_75 = __VERIFIER_nondet_uchar() [L225] input_76 = __VERIFIER_nondet_uchar() [L226] input_77 = __VERIFIER_nondet_uchar() [L227] input_78 = __VERIFIER_nondet_uchar() [L228] input_79 = __VERIFIER_nondet_uchar() [L229] input_80 = __VERIFIER_nondet_uchar() [L230] input_85 = __VERIFIER_nondet_uchar() [L231] input_87 = __VERIFIER_nondet_uchar() [L232] input_89 = __VERIFIER_nondet_uchar() [L233] input_94 = __VERIFIER_nondet_uchar() [L234] input_96 = __VERIFIER_nondet_uchar() [L235] input_98 = __VERIFIER_nondet_uchar() [L236] input_102 = __VERIFIER_nondet_uchar() [L237] input_103 = __VERIFIER_nondet_uchar() [L238] input_108 = __VERIFIER_nondet_uchar() [L239] input_110 = __VERIFIER_nondet_uchar() [L240] input_115 = __VERIFIER_nondet_uchar() [L241] input_117 = __VERIFIER_nondet_uchar() [L242] input_121 = __VERIFIER_nondet_uchar() [L243] input_122 = __VERIFIER_nondet_uchar() [L244] input_127 = __VERIFIER_nondet_uchar() [L245] input_132 = __VERIFIER_nondet_uchar() [L246] input_136 = __VERIFIER_nondet_uchar() [L247] input_137 = __VERIFIER_nondet_uchar() [L248] input_149 = __VERIFIER_nondet_uchar() [L249] input_160 = __VERIFIER_nondet_uchar() [L250] input_161 = __VERIFIER_nondet_uchar() [L251] input_162 = __VERIFIER_nondet_uchar() [L252] input_163 = __VERIFIER_nondet_uchar() [L253] input_164 = __VERIFIER_nondet_uchar() [L254] input_165 = __VERIFIER_nondet_uchar() [L255] input_168 = __VERIFIER_nondet_uchar() [L256] input_170 = __VERIFIER_nondet_uchar() [L257] input_172 = __VERIFIER_nondet_uchar() [L258] input_177 = __VERIFIER_nondet_uchar() [L259] input_179 = __VERIFIER_nondet_uchar() [L260] input_181 = __VERIFIER_nondet_uchar() [L261] input_185 = __VERIFIER_nondet_uchar() [L262] input_186 = __VERIFIER_nondet_uchar() [L263] input_189 = __VERIFIER_nondet_uchar() [L264] input_191 = __VERIFIER_nondet_uchar() [L265] input_196 = __VERIFIER_nondet_uchar() [L266] input_198 = __VERIFIER_nondet_uchar() [L267] input_202 = __VERIFIER_nondet_uchar() [L268] input_203 = __VERIFIER_nondet_uchar() [L269] input_206 = __VERIFIER_nondet_uchar() [L270] input_211 = __VERIFIER_nondet_uchar() [L271] input_215 = __VERIFIER_nondet_uchar() [L272] input_216 = __VERIFIER_nondet_uchar() [L273] input_226 = __VERIFIER_nondet_uchar() [L274] input_233 = __VERIFIER_nondet_uchar() [L275] input_234 = __VERIFIER_nondet_uchar() [L276] input_235 = __VERIFIER_nondet_uchar() [L277] input_236 = __VERIFIER_nondet_uchar() [L278] input_237 = __VERIFIER_nondet_uchar() [L279] input_238 = __VERIFIER_nondet_uchar() [L280] input_241 = __VERIFIER_nondet_uchar() [L281] input_243 = __VERIFIER_nondet_uchar() [L282] input_245 = __VERIFIER_nondet_uchar() [L283] input_250 = __VERIFIER_nondet_uchar() [L284] input_252 = __VERIFIER_nondet_uchar() [L285] input_254 = __VERIFIER_nondet_uchar() [L286] input_258 = __VERIFIER_nondet_uchar() [L287] input_259 = __VERIFIER_nondet_uchar() [L288] input_262 = __VERIFIER_nondet_uchar() [L289] input_264 = __VERIFIER_nondet_uchar() [L290] input_269 = __VERIFIER_nondet_uchar() [L291] input_271 = __VERIFIER_nondet_uchar() [L292] input_275 = __VERIFIER_nondet_uchar() [L293] input_276 = __VERIFIER_nondet_uchar() [L294] input_279 = __VERIFIER_nondet_uchar() [L295] input_284 = __VERIFIER_nondet_uchar() [L296] input_288 = __VERIFIER_nondet_uchar() [L297] input_289 = __VERIFIER_nondet_uchar() [L298] input_299 = __VERIFIER_nondet_uchar() [L299] input_306 = __VERIFIER_nondet_uchar() [L300] input_307 = __VERIFIER_nondet_uchar() [L301] input_308 = __VERIFIER_nondet_uchar() [L302] input_309 = __VERIFIER_nondet_uchar() [L303] input_310 = __VERIFIER_nondet_uchar() [L304] input_311 = __VERIFIER_nondet_uchar() [L305] input_314 = __VERIFIER_nondet_uchar() [L306] input_316 = __VERIFIER_nondet_uchar() [L307] input_318 = __VERIFIER_nondet_uchar() [L308] input_323 = __VERIFIER_nondet_uchar() [L309] input_325 = __VERIFIER_nondet_uchar() [L310] input_327 = __VERIFIER_nondet_uchar() [L311] input_331 = __VERIFIER_nondet_uchar() [L312] input_332 = __VERIFIER_nondet_uchar() [L313] input_335 = __VERIFIER_nondet_uchar() [L314] input_337 = __VERIFIER_nondet_uchar() [L315] input_342 = __VERIFIER_nondet_uchar() [L316] input_344 = __VERIFIER_nondet_uchar() [L317] input_348 = __VERIFIER_nondet_uchar() [L318] input_349 = __VERIFIER_nondet_uchar() [L319] input_352 = __VERIFIER_nondet_uchar() [L320] input_357 = __VERIFIER_nondet_uchar() [L321] input_361 = __VERIFIER_nondet_uchar() [L322] input_362 = __VERIFIER_nondet_uchar() [L323] input_372 = __VERIFIER_nondet_uchar() [L324] input_391 = __VERIFIER_nondet_uchar() [L325] input_392 = __VERIFIER_nondet_uchar() [L326] input_393 = __VERIFIER_nondet_uchar() [L329] SORT_7 var_12_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_12_arg_0=0, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L330] EXPR var_12_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L330] var_12_arg_0 = var_12_arg_0 & mask_SORT_7 [L331] SORT_11 var_12 = var_12_arg_0; [L332] SORT_11 var_14_arg_0 = var_12; [L333] SORT_11 var_14_arg_1 = var_13; [L334] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L335] SORT_7 var_15_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_14=1, var_154=2, var_15_arg_0=0, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L336] EXPR var_15_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_14=1, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L336] var_15_arg_0 = var_15_arg_0 & mask_SORT_7 [L337] SORT_11 var_15 = var_15_arg_0; [L338] SORT_11 var_17_arg_0 = var_15; [L339] SORT_11 var_17_arg_1 = var_16; [L340] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L341] SORT_1 var_18_arg_0 = var_14; [L342] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_18_arg_0=1, var_18_arg_1=0, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L343] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L343] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L344] SORT_7 var_19_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_18=1, var_19_arg_0=0, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L345] EXPR var_19_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_18=1, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L345] var_19_arg_0 = var_19_arg_0 & mask_SORT_7 [L346] SORT_11 var_19 = var_19_arg_0; [L347] SORT_11 var_21_arg_0 = var_19; [L348] SORT_11 var_21_arg_1 = var_20; [L349] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L350] SORT_1 var_22_arg_0 = var_18; [L351] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_22_arg_0=1, var_22_arg_1=0, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L352] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L352] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L353] SORT_7 var_23_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_22=1, var_23_arg_0=0, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L354] EXPR var_23_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_22=1, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L354] var_23_arg_0 = var_23_arg_0 & mask_SORT_7 [L355] SORT_11 var_23 = var_23_arg_0; [L356] SORT_11 var_25_arg_0 = var_23; [L357] SORT_11 var_25_arg_1 = var_24; [L358] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L359] SORT_1 var_26_arg_0 = var_22; [L360] SORT_1 var_26_arg_1 = var_25; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_26_arg_0=1, var_26_arg_1=0, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L361] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L361] SORT_1 var_26 = var_26_arg_0 | var_26_arg_1; [L362] SORT_7 var_27_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_26=1, var_27_arg_0=0, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L363] EXPR var_27_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_26=1, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L363] var_27_arg_0 = var_27_arg_0 & mask_SORT_7 [L364] SORT_11 var_27 = var_27_arg_0; [L365] SORT_11 var_29_arg_0 = var_27; [L366] SORT_11 var_29_arg_1 = var_28; [L367] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L368] SORT_1 var_30_arg_0 = var_26; [L369] SORT_1 var_30_arg_1 = var_29; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_30_arg_0=1, var_30_arg_1=0, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L370] EXPR var_30_arg_0 | var_30_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L370] SORT_1 var_30 = var_30_arg_0 | var_30_arg_1; [L371] SORT_1 var_34_arg_0 = var_30; [L372] SORT_1 var_34 = ~var_34_arg_0; [L373] SORT_1 var_35_arg_0 = var_33; [L374] SORT_1 var_35_arg_1 = var_34; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_35_arg_0=1, var_35_arg_1=-2, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L375] EXPR var_35_arg_0 & var_35_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L375] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L376] EXPR var_35 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L376] var_35 = var_35 & mask_SORT_1 [L377] SORT_1 bad_36_arg_0 = var_35; [L378] CALL __VERIFIER_assert(!(bad_36_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3447 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3447 mSDsluCounter, 19525 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15875 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1210 IncrementalHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 3650 mSDtfsCounter, 1210 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=289occurred in iteration=12, InterpolantAutomatonStates: 104, 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, 14 MinimizatonAttempts, 215 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 906 NumberOfCodeBlocks, 906 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 2733 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:21,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.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 a9990c01c9a1f9597f7bc9fb384dfed8f76d280524d4aa5e1bce8b343e8f7c08 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 22:53:24,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 22:53:24,222 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:24,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 22:53:24,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 22:53:24,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 22:53:24,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 22:53:24,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 22:53:24,268 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 22:53:24,268 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 22:53:24,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 22:53:24,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 22:53:24,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 22:53:24,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 22:53:24,271 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 22:53:24,271 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 22:53:24,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 22:53:24,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 22:53:24,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 22:53:24,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 22:53:24,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 22:53:24,277 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 22:53:24,277 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 22:53:24,278 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 22:53:24,278 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 22:53:24,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 22:53:24,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 22:53:24,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 22:53:24,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 22:53:24,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 22:53:24,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 22:53:24,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:53:24,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 22:53:24,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 22:53:24,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 22:53:24,290 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 22:53:24,290 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 22:53:24,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 22:53:24,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 22:53:24,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 22:53:24,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 22:53:24,291 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 22:53:24,292 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 -> a9990c01c9a1f9597f7bc9fb384dfed8f76d280524d4aa5e1bce8b343e8f7c08 [2024-10-12 22:53:24,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 22:53:24,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 22:53:24,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 22:53:24,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 22:53:24,662 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 22:53:24,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c [2024-10-12 22:53:26,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 22:53:26,581 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 22:53:26,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c [2024-10-12 22:53:26,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a96ec18e/cdc08b90b6c949c3a266df3a9774959d/FLAGb8190136e [2024-10-12 22:53:26,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a96ec18e/cdc08b90b6c949c3a266df3a9774959d [2024-10-12 22:53:26,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 22:53:26,847 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 22:53:26,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 22:53:26,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 22:53:26,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 22:53:26,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:53:26" (1/1) ... [2024-10-12 22:53:26,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@797c4514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:26, skipping insertion in model container [2024-10-12 22:53:26,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:53:26" (1/1) ... [2024-10-12 22:53:26,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 22:53:27,151 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_b03.c[1245,1258] [2024-10-12 22:53:27,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:53:27,470 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 22:53:27,482 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_b03.c[1245,1258] [2024-10-12 22:53:27,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:53:27,613 INFO L204 MainTranslator]: Completed translation [2024-10-12 22:53:27,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:27 WrapperNode [2024-10-12 22:53:27,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 22:53:27,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 22:53:27,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 22:53:27,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 22:53:27,624 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:27" (1/1) ... [2024-10-12 22:53:27,653 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:27" (1/1) ... [2024-10-12 22:53:27,756 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1557 [2024-10-12 22:53:27,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 22:53:27,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 22:53:27,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 22:53:27,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 22:53:27,783 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:27" (1/1) ... [2024-10-12 22:53:27,784 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:27" (1/1) ... [2024-10-12 22:53:27,802 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:27" (1/1) ... [2024-10-12 22:53:27,841 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-12 22:53:27,845 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:27" (1/1) ... [2024-10-12 22:53:27,845 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:27" (1/1) ... [2024-10-12 22:53:27,888 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:27" (1/1) ... [2024-10-12 22:53:27,893 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:27" (1/1) ... [2024-10-12 22:53:27,906 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:27" (1/1) ... [2024-10-12 22:53:27,920 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:27" (1/1) ... [2024-10-12 22:53:27,944 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 22:53:27,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 22:53:27,946 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 22:53:27,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 22:53:27,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:27" (1/1) ... [2024-10-12 22:53:27,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:53:27,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:53:27,983 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:27,987 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:28,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 22:53:28,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 22:53:28,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-12 22:53:28,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 22:53:28,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 22:53:28,344 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 22:53:28,346 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 22:53:29,283 INFO L? ?]: Removed 177 outVars from TransFormulas that were not future-live. [2024-10-12 22:53:29,284 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 22:53:29,379 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 22:53:29,379 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 22:53:29,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:53:29 BoogieIcfgContainer [2024-10-12 22:53:29,380 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 22:53:29,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 22:53:29,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 22:53:29,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 22:53:29,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 10:53:26" (1/3) ... [2024-10-12 22:53:29,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9223d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:53:29, skipping insertion in model container [2024-10-12 22:53:29,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:27" (2/3) ... [2024-10-12 22:53:29,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9223d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:53:29, skipping insertion in model container [2024-10-12 22:53:29,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:53:29" (3/3) ... [2024-10-12 22:53:29,395 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b03.c [2024-10-12 22:53:29,414 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 22:53:29,414 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 22:53:29,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 22:53:29,482 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;@5c2c9dc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 22:53:29,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 22:53:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:29,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-12 22:53:29,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:29,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-12 22:53:29,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:29,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:29,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-12 22:53:29,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:53:29,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892872263] [2024-10-12 22:53:29,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:29,509 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:29,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:53:29,512 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:29,532 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:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:29,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-12 22:53:29,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:53:30,153 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:30,153 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 22:53:30,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:53:30,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892872263] [2024-10-12 22:53:30,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892872263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:30,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:30,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 22:53:30,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086254726] [2024-10-12 22:53:30,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:30,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:53:30,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:53:30,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:53:30,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:53:30,191 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:30,292 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-12 22:53:30,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:53:30,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-12 22:53:30,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:30,301 INFO L225 Difference]: With dead ends: 15 [2024-10-12 22:53:30,302 INFO L226 Difference]: Without dead ends: 9 [2024-10-12 22:53:30,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:53:30,308 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:30,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:53:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-12 22:53:30,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-12 22:53:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-12 22:53:30,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-12 22:53:30,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:30,384 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-12 22:53:30,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-12 22:53:30,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 22:53:30,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:30,384 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-12 22:53:30,394 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:30,588 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:30,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:30,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:30,590 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-12 22:53:30,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:53:30,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690854218] [2024-10-12 22:53:30,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:30,591 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:30,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:53:30,593 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:30,594 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:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:31,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-12 22:53:31,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:53:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:53:31,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 22:53:31,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:53:31,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:53:31,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690854218] [2024-10-12 22:53:31,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690854218] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 22:53:31,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 22:53:31,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-12 22:53:31,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745171388] [2024-10-12 22:53:31,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 22:53:31,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:53:31,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:53:31,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:53:31,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:53:31,789 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:31,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:31,931 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-12 22:53:31,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:53:31,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-12 22:53:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:31,933 INFO L225 Difference]: With dead ends: 14 [2024-10-12 22:53:31,933 INFO L226 Difference]: Without dead ends: 12 [2024-10-12 22:53:31,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-12 22:53:31,934 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:31,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 9 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:53:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-12 22:53:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-10-12 22:53:31,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-12 22:53:31,938 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-12 22:53:31,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:31,938 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-12 22:53:31,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:31,939 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-12 22:53:31,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 22:53:31,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:31,939 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-12 22:53:31,946 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:32,142 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:32,143 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:32,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:32,143 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-12 22:53:32,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:53:32,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734236114] [2024-10-12 22:53:32,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 22:53:32,145 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:32,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:53:32,150 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:32,151 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:32,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 22:53:32,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 22:53:32,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-12 22:53:32,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:53:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:53:35,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 22:54:02,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:54:02,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:54:02,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734236114] [2024-10-12 22:54:02,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734236114] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 22:54:02,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 22:54:02,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-12 22:54:02,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275294901] [2024-10-12 22:54:02,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 22:54:02,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 22:54:02,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:54:02,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 22:54:02,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-12 22:54:02,946 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:54:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:54:03,256 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-10-12 22:54:03,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 22:54:03,256 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-12 22:54:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:54:03,257 INFO L225 Difference]: With dead ends: 17 [2024-10-12 22:54:03,257 INFO L226 Difference]: Without dead ends: 15 [2024-10-12 22:54:03,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-10-12 22:54:03,259 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:54:03,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 12 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:54:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-12 22:54:03,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-12 22:54:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:54:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-12 22:54:03,263 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2024-10-12 22:54:03,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:54:03,263 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-12 22:54:03,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:54:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-12 22:54:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 22:54:03,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:54:03,265 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-12 22:54:03,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-12 22:54:03,466 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:54:03,466 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:54:03,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:54:03,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 3 times [2024-10-12 22:54:03,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:54:03,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717694993] [2024-10-12 22:54:03,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 22:54:03,469 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:54:03,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:54:03,472 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:54:03,474 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:54:04,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-12 22:54:04,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 22:54:04,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-12 22:54:04,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:54:12,944 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:54:12,945 INFO L311 TraceCheckSpWp]: Computing backward predicates...