./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.peterson.2.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peterson.2.prop1-func-interl.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 686e0476f4ae49b21a7ab6baa56f3f70e72f3953edc1251a2c9d1a62b00bd909 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:32:30,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:32:30,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 06:32:30,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:32:30,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:32:30,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:32:30,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:32:30,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:32:30,598 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:32:30,599 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:32:30,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:32:30,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:32:30,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:32:30,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:32:30,603 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:32:30,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:32:30,604 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:32:30,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 06:32:30,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:32:30,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:32:30,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:32:30,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:32:30,609 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:32:30,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:32:30,610 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:32:30,610 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:32:30,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:32:30,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:32:30,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:32:30,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:32:30,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:32:30,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:32:30,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:32:30,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 06:32:30,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 06:32:30,615 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:32:30,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:32:30,615 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:32:30,615 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:32:30,616 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 686e0476f4ae49b21a7ab6baa56f3f70e72f3953edc1251a2c9d1a62b00bd909 [2024-10-11 06:32:30,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:32:30,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:32:30,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:32:30,926 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:32:30,926 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:32:30,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peterson.2.prop1-func-interl.c [2024-10-11 06:32:32,724 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:32:33,024 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:32:33,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peterson.2.prop1-func-interl.c [2024-10-11 06:32:33,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4b1a198c7/800cb0eeb53a420f8906313665a16218/FLAG5d4957c7e [2024-10-11 06:32:33,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4b1a198c7/800cb0eeb53a420f8906313665a16218 [2024-10-11 06:32:33,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:32:33,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:32:33,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:32:33,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:32:33,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:32:33,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:32:33" (1/1) ... [2024-10-11 06:32:33,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@491f33aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:33, skipping insertion in model container [2024-10-11 06:32:33,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:32:33" (1/1) ... [2024-10-11 06:32:33,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:32:33,471 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.peterson.2.prop1-func-interl.c[1175,1188] [2024-10-11 06:32:33,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:32:33,889 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:32:33,900 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.peterson.2.prop1-func-interl.c[1175,1188] [2024-10-11 06:32:34,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:32:34,078 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:32:34,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:34 WrapperNode [2024-10-11 06:32:34,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:32:34,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:32:34,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:32:34,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:32:34,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:34" (1/1) ... [2024-10-11 06:32:34,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:34" (1/1) ... [2024-10-11 06:32:35,212 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4859 [2024-10-11 06:32:35,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:32:35,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:32:35,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:32:35,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:32:35,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:34" (1/1) ... [2024-10-11 06:32:35,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:34" (1/1) ... [2024-10-11 06:32:35,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:34" (1/1) ... [2024-10-11 06:32:35,544 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 06:32:35,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:34" (1/1) ... [2024-10-11 06:32:35,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:34" (1/1) ... [2024-10-11 06:32:35,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:34" (1/1) ... [2024-10-11 06:32:35,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:34" (1/1) ... [2024-10-11 06:32:35,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:34" (1/1) ... [2024-10-11 06:32:36,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:34" (1/1) ... [2024-10-11 06:32:36,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:32:36,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:32:36,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:32:36,221 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:32:36,222 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:34" (1/1) ... [2024-10-11 06:32:36,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:32:36,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:32:36,263 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:32:36,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:32:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:32:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 06:32:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:32:36,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:32:36,647 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:32:36,652 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:32:41,624 INFO L? ?]: Removed 2711 outVars from TransFormulas that were not future-live. [2024-10-11 06:32:41,625 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:32:41,730 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:32:41,730 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:32:41,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:32:41 BoogieIcfgContainer [2024-10-11 06:32:41,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:32:41,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:32:41,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:32:41,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:32:41,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:32:33" (1/3) ... [2024-10-11 06:32:41,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@986766a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:32:41, skipping insertion in model container [2024-10-11 06:32:41,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:34" (2/3) ... [2024-10-11 06:32:41,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@986766a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:32:41, skipping insertion in model container [2024-10-11 06:32:41,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:32:41" (3/3) ... [2024-10-11 06:32:41,740 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.peterson.2.prop1-func-interl.c [2024-10-11 06:32:41,757 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:32:41,757 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:32:41,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:32:41,862 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;@5d65500b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:32:41,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:32:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 1667 states, 1665 states have (on average 1.5003003003003004) internal successors, (2498), 1666 states have internal predecessors, (2498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:41,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 06:32:41,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:32:41,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:32:41,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:32:41,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:32:41,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1724408584, now seen corresponding path program 1 times [2024-10-11 06:32:41,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:32:41,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894665296] [2024-10-11 06:32:41,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:32:41,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:32:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:32:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:32:43,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:32:43,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894665296] [2024-10-11 06:32:43,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894665296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:32:43,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:32:43,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:32:43,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834883362] [2024-10-11 06:32:43,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:32:43,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:32:43,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:32:43,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:32:43,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:32:43,126 INFO L87 Difference]: Start difference. First operand has 1667 states, 1665 states have (on average 1.5003003003003004) internal successors, (2498), 1666 states have internal predecessors, (2498), 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 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:32:43,307 INFO L93 Difference]: Finished difference Result 3222 states and 4830 transitions. [2024-10-11 06:32:43,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:32:43,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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 106 [2024-10-11 06:32:43,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:32:43,338 INFO L225 Difference]: With dead ends: 3222 [2024-10-11 06:32:43,338 INFO L226 Difference]: Without dead ends: 1668 [2024-10-11 06:32:43,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:32:43,352 INFO L432 NwaCegarLoop]: 2493 mSDtfsCounter, 0 mSDsluCounter, 4981 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7474 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:32:43,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7474 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:32:43,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2024-10-11 06:32:43,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1668. [2024-10-11 06:32:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1667 states have (on average 1.498500299940012) internal successors, (2498), 1667 states have internal predecessors, (2498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2498 transitions. [2024-10-11 06:32:43,479 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2498 transitions. Word has length 106 [2024-10-11 06:32:43,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:32:43,480 INFO L471 AbstractCegarLoop]: Abstraction has 1668 states and 2498 transitions. [2024-10-11 06:32:43,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:43,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2498 transitions. [2024-10-11 06:32:43,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 06:32:43,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:32:43,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:32:43,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 06:32:43,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:32:43,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:32:43,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1915362736, now seen corresponding path program 1 times [2024-10-11 06:32:43,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:32:43,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484530028] [2024-10-11 06:32:43,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:32:43,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:32:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:32:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:32:43,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:32:43,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484530028] [2024-10-11 06:32:43,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484530028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:32:43,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:32:43,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:32:43,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786121904] [2024-10-11 06:32:43,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:32:43,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:32:43,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:32:43,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:32:43,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:32:43,878 INFO L87 Difference]: Start difference. First operand 1668 states and 2498 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:43,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:32:43,969 INFO L93 Difference]: Finished difference Result 3225 states and 4830 transitions. [2024-10-11 06:32:43,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:32:43,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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 107 [2024-10-11 06:32:43,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:32:43,978 INFO L225 Difference]: With dead ends: 3225 [2024-10-11 06:32:43,978 INFO L226 Difference]: Without dead ends: 1670 [2024-10-11 06:32:43,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:32:43,982 INFO L432 NwaCegarLoop]: 2493 mSDtfsCounter, 0 mSDsluCounter, 4978 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7471 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:32:43,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7471 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:32:43,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2024-10-11 06:32:44,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2024-10-11 06:32:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1669 states have (on average 1.4979029358897544) internal successors, (2500), 1669 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2500 transitions. [2024-10-11 06:32:44,025 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2500 transitions. Word has length 107 [2024-10-11 06:32:44,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:32:44,026 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2500 transitions. [2024-10-11 06:32:44,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:44,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2500 transitions. [2024-10-11 06:32:44,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 06:32:44,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:32:44,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:32:44,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 06:32:44,034 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:32:44,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:32:44,034 INFO L85 PathProgramCache]: Analyzing trace with hash -344667951, now seen corresponding path program 1 times [2024-10-11 06:32:44,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:32:44,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750308822] [2024-10-11 06:32:44,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:32:44,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:32:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:32:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:32:44,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:32:44,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750308822] [2024-10-11 06:32:44,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750308822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:32:44,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:32:44,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:32:44,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064010318] [2024-10-11 06:32:44,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:32:44,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:32:44,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:32:44,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:32:44,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:32:44,364 INFO L87 Difference]: Start difference. First operand 1670 states and 2500 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:32:44,446 INFO L93 Difference]: Finished difference Result 3233 states and 4840 transitions. [2024-10-11 06:32:44,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:32:44,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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 108 [2024-10-11 06:32:44,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:32:44,456 INFO L225 Difference]: With dead ends: 3233 [2024-10-11 06:32:44,456 INFO L226 Difference]: Without dead ends: 1676 [2024-10-11 06:32:44,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:32:44,462 INFO L432 NwaCegarLoop]: 2493 mSDtfsCounter, 4 mSDsluCounter, 4972 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7465 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:32:44,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7465 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:32:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2024-10-11 06:32:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1676. [2024-10-11 06:32:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1675 states have (on average 1.4973134328358209) internal successors, (2508), 1675 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2508 transitions. [2024-10-11 06:32:44,508 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2508 transitions. Word has length 108 [2024-10-11 06:32:44,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:32:44,509 INFO L471 AbstractCegarLoop]: Abstraction has 1676 states and 2508 transitions. [2024-10-11 06:32:44,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:44,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2508 transitions. [2024-10-11 06:32:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 06:32:44,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:32:44,514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:32:44,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 06:32:44,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:32:44,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:32:44,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1040714306, now seen corresponding path program 1 times [2024-10-11 06:32:44,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:32:44,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158033242] [2024-10-11 06:32:44,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:32:44,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:32:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:32:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:32:44,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:32:44,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158033242] [2024-10-11 06:32:44,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158033242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:32:44,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:32:44,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:32:44,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862021354] [2024-10-11 06:32:44,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:32:44,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:32:44,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:32:44,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:32:44,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:32:44,876 INFO L87 Difference]: Start difference. First operand 1676 states and 2508 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:44,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:32:45,000 INFO L93 Difference]: Finished difference Result 3243 states and 4852 transitions. [2024-10-11 06:32:45,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:32:45,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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 109 [2024-10-11 06:32:45,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:32:45,009 INFO L225 Difference]: With dead ends: 3243 [2024-10-11 06:32:45,010 INFO L226 Difference]: Without dead ends: 1680 [2024-10-11 06:32:45,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:32:45,014 INFO L432 NwaCegarLoop]: 2493 mSDtfsCounter, 0 mSDsluCounter, 7448 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9941 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:32:45,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9941 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:32:45,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2024-10-11 06:32:45,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1676. [2024-10-11 06:32:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1675 states have (on average 1.4973134328358209) internal successors, (2508), 1675 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:45,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2508 transitions. [2024-10-11 06:32:45,054 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2508 transitions. Word has length 109 [2024-10-11 06:32:45,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:32:45,055 INFO L471 AbstractCegarLoop]: Abstraction has 1676 states and 2508 transitions. [2024-10-11 06:32:45,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2508 transitions. [2024-10-11 06:32:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 06:32:45,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:32:45,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:32:45,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 06:32:45,058 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:32:45,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:32:45,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1288484950, now seen corresponding path program 1 times [2024-10-11 06:32:45,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:32:45,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200044500] [2024-10-11 06:32:45,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:32:45,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:32:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:32:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:32:45,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:32:45,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200044500] [2024-10-11 06:32:45,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200044500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:32:45,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:32:45,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:32:45,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632350286] [2024-10-11 06:32:45,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:32:45,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:32:45,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:32:45,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:32:45,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:32:45,395 INFO L87 Difference]: Start difference. First operand 1676 states and 2508 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:32:47,329 INFO L93 Difference]: Finished difference Result 4786 states and 7162 transitions. [2024-10-11 06:32:47,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:32:47,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 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 110 [2024-10-11 06:32:47,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:32:47,341 INFO L225 Difference]: With dead ends: 4786 [2024-10-11 06:32:47,342 INFO L226 Difference]: Without dead ends: 3223 [2024-10-11 06:32:47,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:32:47,346 INFO L432 NwaCegarLoop]: 1899 mSDtfsCounter, 2381 mSDsluCounter, 5566 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2381 SdHoareTripleChecker+Valid, 7465 SdHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 06:32:47,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2381 Valid, 7465 Invalid, 2351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 06:32:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2024-10-11 06:32:47,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 1755. [2024-10-11 06:32:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1754 states have (on average 1.4965792474344355) internal successors, (2625), 1754 states have internal predecessors, (2625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:47,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2625 transitions. [2024-10-11 06:32:47,400 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2625 transitions. Word has length 110 [2024-10-11 06:32:47,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:32:47,400 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2625 transitions. [2024-10-11 06:32:47,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:47,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2625 transitions. [2024-10-11 06:32:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 06:32:47,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:32:47,402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:32:47,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 06:32:47,403 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:32:47,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:32:47,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1054342950, now seen corresponding path program 1 times [2024-10-11 06:32:47,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:32:47,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160298501] [2024-10-11 06:32:47,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:32:47,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:32:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:32:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:32:47,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:32:47,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160298501] [2024-10-11 06:32:47,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160298501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:32:47,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:32:47,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:32:47,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042975474] [2024-10-11 06:32:47,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:32:47,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:32:47,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:32:47,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:32:47,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:32:47,760 INFO L87 Difference]: Start difference. First operand 1755 states and 2625 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:32:49,005 INFO L93 Difference]: Finished difference Result 3318 states and 4964 transitions. [2024-10-11 06:32:49,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:32:49,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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 111 [2024-10-11 06:32:49,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:32:49,012 INFO L225 Difference]: With dead ends: 3318 [2024-10-11 06:32:49,013 INFO L226 Difference]: Without dead ends: 1755 [2024-10-11 06:32:49,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:32:49,022 INFO L432 NwaCegarLoop]: 1889 mSDtfsCounter, 2395 mSDsluCounter, 3769 mSDsCounter, 0 mSdLazyCounter, 1815 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2395 SdHoareTripleChecker+Valid, 5658 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:32:49,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2395 Valid, 5658 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1815 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 06:32:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2024-10-11 06:32:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1755. [2024-10-11 06:32:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1754 states have (on average 1.4942987457240593) internal successors, (2621), 1754 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2621 transitions. [2024-10-11 06:32:49,057 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2621 transitions. Word has length 111 [2024-10-11 06:32:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:32:49,057 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2621 transitions. [2024-10-11 06:32:49,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2621 transitions. [2024-10-11 06:32:49,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 06:32:49,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:32:49,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:32:49,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 06:32:49,063 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:32:49,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:32:49,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1994453867, now seen corresponding path program 1 times [2024-10-11 06:32:49,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:32:49,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636292196] [2024-10-11 06:32:49,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:32:49,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:32:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:32:49,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 06:32:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:32:49,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 06:32:49,279 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 06:32:49,281 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 06:32:49,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 06:32:49,286 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:32:49,387 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 06:32:49,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:32:49 BoogieIcfgContainer [2024-10-11 06:32:49,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 06:32:49,390 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 06:32:49,390 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 06:32:49,391 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 06:32:49,391 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:32:41" (3/4) ... [2024-10-11 06:32:49,393 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 06:32:49,394 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 06:32:49,395 INFO L158 Benchmark]: Toolchain (without parser) took 16316.56ms. Allocated memory was 184.5MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 112.6MB in the beginning and 879.9MB in the end (delta: -767.3MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-10-11 06:32:49,395 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory was 143.9MB in the beginning and 143.7MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:32:49,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1000.61ms. Allocated memory is still 184.5MB. Free memory was 112.4MB in the beginning and 100.2MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 06:32:49,395 INFO L158 Benchmark]: Boogie Procedure Inliner took 1132.10ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 100.2MB in the beginning and 251.7MB in the end (delta: -151.4MB). Peak memory consumption was 111.6MB. Max. memory is 16.1GB. [2024-10-11 06:32:49,396 INFO L158 Benchmark]: Boogie Preprocessor took 1002.74ms. Allocated memory is still 369.1MB. Free memory was 251.7MB in the beginning and 231.7MB in the end (delta: 19.9MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2024-10-11 06:32:49,396 INFO L158 Benchmark]: RCFGBuilder took 5509.49ms. Allocated memory was 369.1MB in the beginning and 1.2GB in the end (delta: 811.6MB). Free memory was 231.7MB in the beginning and 863.3MB in the end (delta: -631.6MB). Peak memory consumption was 182.1MB. Max. memory is 16.1GB. [2024-10-11 06:32:49,396 INFO L158 Benchmark]: TraceAbstraction took 7656.94ms. Allocated memory was 1.2GB in the beginning and 2.1GB in the end (delta: 929.0MB). Free memory was 863.3MB in the beginning and 879.9MB in the end (delta: -16.6MB). Peak memory consumption was 913.5MB. Max. memory is 16.1GB. [2024-10-11 06:32:49,397 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 2.1GB. Free memory is still 879.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:32:49,398 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.19ms. Allocated memory is still 184.5MB. Free memory was 143.9MB in the beginning and 143.7MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1000.61ms. Allocated memory is still 184.5MB. Free memory was 112.4MB in the beginning and 100.2MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 1132.10ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 100.2MB in the beginning and 251.7MB in the end (delta: -151.4MB). Peak memory consumption was 111.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 1002.74ms. Allocated memory is still 369.1MB. Free memory was 251.7MB in the beginning and 231.7MB in the end (delta: 19.9MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. * RCFGBuilder took 5509.49ms. Allocated memory was 369.1MB in the beginning and 1.2GB in the end (delta: 811.6MB). Free memory was 231.7MB in the beginning and 863.3MB in the end (delta: -631.6MB). Peak memory consumption was 182.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7656.94ms. Allocated memory was 1.2GB in the beginning and 2.1GB in the end (delta: 929.0MB). Free memory was 863.3MB in the beginning and 879.9MB in the end (delta: -16.6MB). Peak memory consumption was 913.5MB. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 2.1GB. Free memory is still 879.9MB. 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 225. 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_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_30 = 0; [L40] const SORT_4 var_63 = 1; [L41] const SORT_4 var_64 = 0; [L42] const SORT_2 var_74 = 0; [L43] const SORT_3 var_90 = 0; [L44] const SORT_2 var_95 = 2; [L45] const SORT_2 var_101 = 1; [L46] const SORT_4 var_121 = 2; [L47] const SORT_4 var_229 = 3; [L48] const SORT_2 var_251 = 3; [L50] SORT_1 input_73; [L51] SORT_1 input_75; [L52] SORT_1 input_79; [L53] SORT_1 input_80; [L54] SORT_1 input_84; [L55] SORT_1 input_85; [L56] SORT_1 input_89; [L57] SORT_1 input_96; [L58] SORT_1 input_102; [L59] SORT_1 input_132; [L60] SORT_1 input_135; [L61] SORT_1 input_139; [L62] SORT_1 input_146; [L63] SORT_1 input_149; [L64] SORT_1 input_153; [L65] SORT_1 input_160; [L66] SORT_1 input_163; [L67] SORT_1 input_167; [L68] SORT_1 input_177; [L69] SORT_1 input_195; [L70] SORT_1 input_213; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L72] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L73] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L74] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L75] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L76] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L77] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L78] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L79] SORT_2 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L80] SORT_2 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L81] SORT_2 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L82] SORT_2 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L83] SORT_2 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L84] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L85] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L86] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L87] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L88] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L89] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L90] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L91] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L92] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L93] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L94] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L95] SORT_1 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L96] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L97] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L98] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L98] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L99] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=1, var_121=2, var_229=3, var_251=3, var_30=0, var_5=0, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L99] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L101] SORT_2 init_7_arg_1 = var_5; [L102] state_6 = init_7_arg_1 [L103] SORT_2 init_9_arg_1 = var_5; [L104] state_8 = init_9_arg_1 [L105] SORT_2 init_11_arg_1 = var_5; [L106] state_10 = init_11_arg_1 [L107] SORT_2 init_13_arg_1 = var_5; [L108] state_12 = init_13_arg_1 [L109] SORT_2 init_15_arg_1 = var_5; [L110] state_14 = init_15_arg_1 [L111] SORT_2 init_17_arg_1 = var_5; [L112] state_16 = init_17_arg_1 [L113] SORT_2 init_19_arg_1 = var_5; [L114] state_18 = init_19_arg_1 [L115] SORT_2 init_21_arg_1 = var_5; [L116] state_20 = init_21_arg_1 [L117] SORT_2 init_23_arg_1 = var_5; [L118] state_22 = init_23_arg_1 [L119] SORT_2 init_25_arg_1 = var_5; [L120] state_24 = init_25_arg_1 [L121] SORT_2 init_27_arg_1 = var_5; [L122] state_26 = init_27_arg_1 [L123] SORT_2 init_29_arg_1 = var_5; [L124] state_28 = init_29_arg_1 [L125] SORT_1 init_32_arg_1 = var_30; [L126] state_31 = init_32_arg_1 [L127] SORT_1 init_34_arg_1 = var_30; [L128] state_33 = init_34_arg_1 [L129] SORT_1 init_36_arg_1 = var_30; [L130] state_35 = init_36_arg_1 [L131] SORT_1 init_38_arg_1 = var_30; [L132] state_37 = init_38_arg_1 [L133] SORT_1 init_40_arg_1 = var_30; [L134] state_39 = init_40_arg_1 [L135] SORT_1 init_42_arg_1 = var_30; [L136] state_41 = init_42_arg_1 [L137] SORT_1 init_44_arg_1 = var_30; [L138] state_43 = init_44_arg_1 [L139] SORT_1 init_46_arg_1 = var_30; [L140] state_45 = init_46_arg_1 [L141] SORT_1 init_48_arg_1 = var_30; [L142] state_47 = init_48_arg_1 [L143] SORT_1 init_50_arg_1 = var_30; [L144] state_49 = init_50_arg_1 [L145] SORT_1 init_52_arg_1 = var_30; [L146] state_51 = init_52_arg_1 [L147] SORT_1 init_54_arg_1 = var_30; [L148] state_53 = init_54_arg_1 [L149] SORT_1 init_56_arg_1 = var_30; [L150] state_55 = init_56_arg_1 [L151] SORT_1 init_58_arg_1 = var_30; [L152] state_57 = init_58_arg_1 [L153] SORT_1 init_60_arg_1 = var_30; [L154] state_59 = init_60_arg_1 [L155] SORT_1 init_62_arg_1 = var_30; [L156] state_61 = init_62_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L159] input_73 = __VERIFIER_nondet_uchar() [L160] EXPR input_73 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L160] input_73 = input_73 & mask_SORT_1 [L161] input_75 = __VERIFIER_nondet_uchar() [L162] EXPR input_75 & mask_SORT_1 VAL [input_73=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L162] input_75 = input_75 & mask_SORT_1 [L163] input_79 = __VERIFIER_nondet_uchar() [L164] EXPR input_79 & mask_SORT_1 VAL [input_73=0, input_75=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L164] input_79 = input_79 & mask_SORT_1 [L165] input_80 = __VERIFIER_nondet_uchar() [L166] EXPR input_80 & mask_SORT_1 VAL [input_73=0, input_75=0, input_79=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L166] input_80 = input_80 & mask_SORT_1 [L167] input_84 = __VERIFIER_nondet_uchar() [L168] EXPR input_84 & mask_SORT_1 VAL [input_73=0, input_75=0, input_79=0, input_80=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L168] input_84 = input_84 & mask_SORT_1 [L169] input_85 = __VERIFIER_nondet_uchar() [L170] EXPR input_85 & mask_SORT_1 VAL [input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L170] input_85 = input_85 & mask_SORT_1 [L171] input_89 = __VERIFIER_nondet_uchar() [L172] EXPR input_89 & mask_SORT_1 VAL [input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L172] input_89 = input_89 & mask_SORT_1 [L173] input_96 = __VERIFIER_nondet_uchar() [L174] EXPR input_96 & mask_SORT_1 VAL [input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L174] input_96 = input_96 & mask_SORT_1 [L175] input_102 = __VERIFIER_nondet_uchar() [L176] EXPR input_102 & mask_SORT_1 VAL [input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L176] input_102 = input_102 & mask_SORT_1 [L177] input_132 = __VERIFIER_nondet_uchar() [L178] EXPR input_132 & mask_SORT_1 VAL [input_102=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L178] input_132 = input_132 & mask_SORT_1 [L179] input_135 = __VERIFIER_nondet_uchar() [L180] EXPR input_135 & mask_SORT_1 VAL [input_102=0, input_132=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L180] input_135 = input_135 & mask_SORT_1 [L181] input_139 = __VERIFIER_nondet_uchar() [L182] EXPR input_139 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L182] input_139 = input_139 & mask_SORT_1 [L183] input_146 = __VERIFIER_nondet_uchar() [L184] EXPR input_146 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L184] input_146 = input_146 & mask_SORT_1 [L185] input_149 = __VERIFIER_nondet_uchar() [L186] EXPR input_149 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L186] input_149 = input_149 & mask_SORT_1 [L187] input_153 = __VERIFIER_nondet_uchar() [L188] EXPR input_153 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L188] input_153 = input_153 & mask_SORT_1 [L189] input_160 = __VERIFIER_nondet_uchar() [L190] EXPR input_160 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L190] input_160 = input_160 & mask_SORT_1 [L191] input_163 = __VERIFIER_nondet_uchar() [L192] EXPR input_163 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L192] input_163 = input_163 & mask_SORT_1 [L193] input_167 = __VERIFIER_nondet_uchar() [L194] EXPR input_167 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_163=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L194] input_167 = input_167 & mask_SORT_1 [L195] input_177 = __VERIFIER_nondet_uchar() [L196] input_195 = __VERIFIER_nondet_uchar() [L197] input_213 = __VERIFIER_nondet_uchar() [L200] SORT_1 var_65_arg_0 = state_33; [L201] SORT_4 var_65_arg_1 = var_63; [L202] SORT_4 var_65_arg_2 = var_64; [L203] SORT_4 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L204] SORT_1 var_66_arg_0 = state_43; [L205] SORT_4 var_66_arg_1 = var_63; [L206] SORT_4 var_66_arg_2 = var_64; [L207] SORT_4 var_66 = var_66_arg_0 ? var_66_arg_1 : var_66_arg_2; [L208] SORT_4 var_67_arg_0 = var_65; [L209] SORT_4 var_67_arg_1 = var_66; [L210] SORT_4 var_67 = var_67_arg_0 + var_67_arg_1; [L211] SORT_1 var_68_arg_0 = state_53; [L212] SORT_4 var_68_arg_1 = var_63; [L213] SORT_4 var_68_arg_2 = var_64; [L214] SORT_4 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; [L215] SORT_4 var_69_arg_0 = var_67; [L216] SORT_4 var_69_arg_1 = var_68; [L217] SORT_4 var_69 = var_69_arg_0 + var_69_arg_1; VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_163=0, input_167=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_69=0, var_74=0, var_90=0, var_95=2] [L218] EXPR var_69 & mask_SORT_4 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_163=0, input_167=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L218] var_69 = var_69 & mask_SORT_4 [L219] SORT_4 var_70_arg_0 = var_69; [L220] SORT_4 var_70_arg_1 = var_63; [L221] SORT_1 var_70 = var_70_arg_0 <= var_70_arg_1; [L222] SORT_1 var_71_arg_0 = ~state_61; VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_163=0, input_167=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_70=1, var_71_arg_0=-1, var_74=0, var_90=0, var_95=2] [L223] EXPR var_71_arg_0 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_163=0, input_167=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_70=1, var_74=0, var_90=0, var_95=2] [L223] var_71_arg_0 = var_71_arg_0 & mask_SORT_1 [L224] SORT_1 var_71_arg_1 = ~var_70; VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_163=0, input_167=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_71_arg_0=1, var_71_arg_1=-2, var_74=0, var_90=0, var_95=2] [L225] EXPR var_71_arg_1 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_163=0, input_167=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_71_arg_0=1, var_74=0, var_90=0, var_95=2] [L225] var_71_arg_1 = var_71_arg_1 & mask_SORT_1 [L226] EXPR var_71_arg_0 & var_71_arg_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_163=0, input_167=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L226] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L227] EXPR var_71 & mask_SORT_1 VAL [input_102=0, input_132=0, input_135=0, input_139=0, input_146=0, input_149=0, input_153=0, input_160=0, input_163=0, input_167=0, input_73=0, input_75=0, input_79=0, input_80=0, input_84=0, input_85=0, input_89=0, input_96=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_101=1, var_121=2, var_229=3, var_251=3, var_63=1, var_64=0, var_74=0, var_90=0, var_95=2] [L227] var_71 = var_71 & mask_SORT_1 [L228] SORT_1 bad_72_arg_0 = var_71; [L229] CALL __VERIFIER_assert(!(bad_72_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1667 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4780 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4780 mSDsluCounter, 45474 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31714 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4258 IncrementalHoareTripleChecker+Invalid, 4261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 13760 mSDtfsCounter, 4258 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1755occurred in iteration=5, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 1472 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 763 NumberOfCodeBlocks, 763 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 645 ConstructedInterpolants, 0 QuantifiedInterpolants, 1522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 06:32:49,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peterson.2.prop1-func-interl.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 686e0476f4ae49b21a7ab6baa56f3f70e72f3953edc1251a2c9d1a62b00bd909 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:32:52,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:32:52,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 06:32:52,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:32:52,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:32:52,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:32:52,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:32:52,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:32:52,612 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:32:52,614 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:32:52,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:32:52,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:32:52,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:32:52,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:32:52,620 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:32:52,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:32:52,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:32:52,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:32:52,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:32:52,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:32:52,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:32:52,622 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 06:32:52,622 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 06:32:52,622 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:32:52,623 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 06:32:52,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:32:52,623 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:32:52,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:32:52,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:32:52,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:32:52,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:32:52,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:32:52,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:32:52,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:32:52,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:32:52,626 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 06:32:52,627 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 06:32:52,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:32:52,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:32:52,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:32:52,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:32:52,629 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 06:32:52,629 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 686e0476f4ae49b21a7ab6baa56f3f70e72f3953edc1251a2c9d1a62b00bd909 [2024-10-11 06:32:52,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:32:52,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:32:52,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:32:52,993 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:32:52,994 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:32:52,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peterson.2.prop1-func-interl.c [2024-10-11 06:32:54,895 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:32:55,160 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:32:55,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peterson.2.prop1-func-interl.c [2024-10-11 06:32:55,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f0497582b/2987fb19bb6a484581a93e8079cedac2/FLAGc49c6daac [2024-10-11 06:32:55,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f0497582b/2987fb19bb6a484581a93e8079cedac2 [2024-10-11 06:32:55,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:32:55,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:32:55,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:32:55,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:32:55,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:32:55,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:32:55" (1/1) ... [2024-10-11 06:32:55,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f73b078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:55, skipping insertion in model container [2024-10-11 06:32:55,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:32:55" (1/1) ... [2024-10-11 06:32:55,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:32:55,514 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.peterson.2.prop1-func-interl.c[1175,1188] [2024-10-11 06:32:55,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:32:55,820 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:32:55,833 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.peterson.2.prop1-func-interl.c[1175,1188] [2024-10-11 06:32:55,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:32:56,007 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:32:56,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:56 WrapperNode [2024-10-11 06:32:56,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:32:56,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:32:56,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:32:56,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:32:56,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:56" (1/1) ... [2024-10-11 06:32:56,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:56" (1/1) ... [2024-10-11 06:32:56,198 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1539 [2024-10-11 06:32:56,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:32:56,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:32:56,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:32:56,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:32:56,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:56" (1/1) ... [2024-10-11 06:32:56,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:56" (1/1) ... [2024-10-11 06:32:56,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:56" (1/1) ... [2024-10-11 06:32:56,293 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 06:32:56,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:56" (1/1) ... [2024-10-11 06:32:56,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:56" (1/1) ... [2024-10-11 06:32:56,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:56" (1/1) ... [2024-10-11 06:32:56,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:56" (1/1) ... [2024-10-11 06:32:56,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:56" (1/1) ... [2024-10-11 06:32:56,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:56" (1/1) ... [2024-10-11 06:32:56,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:32:56,416 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:32:56,417 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:32:56,417 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:32:56,418 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:56" (1/1) ... [2024-10-11 06:32:56,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:32:56,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:32:56,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:32:56,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:32:56,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:32:56,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 06:32:56,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:32:56,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:32:56,885 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:32:56,888 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:32:58,728 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-10-11 06:32:58,729 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:32:58,803 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:32:58,804 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:32:58,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:32:58 BoogieIcfgContainer [2024-10-11 06:32:58,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:32:58,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:32:58,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:32:58,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:32:58,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:32:55" (1/3) ... [2024-10-11 06:32:58,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3951bf9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:32:58, skipping insertion in model container [2024-10-11 06:32:58,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:32:56" (2/3) ... [2024-10-11 06:32:58,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3951bf9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:32:58, skipping insertion in model container [2024-10-11 06:32:58,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:32:58" (3/3) ... [2024-10-11 06:32:58,815 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.peterson.2.prop1-func-interl.c [2024-10-11 06:32:58,832 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:32:58,832 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:32:58,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:32:58,950 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;@62cc0b4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:32:58,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:32:58,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:58,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 06:32:58,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:32:58,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 06:32:58,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:32:58,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:32:58,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 06:32:58,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:32:58,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531440462] [2024-10-11 06:32:58,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:32:58,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:32:58,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:32:58,991 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:32:58,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 06:32:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:32:59,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 06:32:59,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:32:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:32:59,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:32:59,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:32:59,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531440462] [2024-10-11 06:32:59,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531440462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:32:59,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:32:59,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 06:32:59,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398212920] [2024-10-11 06:32:59,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:32:59,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:32:59,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:32:59,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:32:59,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:32:59,719 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:32:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:32:59,979 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 06:32:59,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:32:59,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 06:32:59,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:32:59,990 INFO L225 Difference]: With dead ends: 15 [2024-10-11 06:32:59,990 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 06:32:59,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:32:59,998 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:33:00,000 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.2s Time] [2024-10-11 06:33:00,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 06:33:00,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 06:33:00,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:33:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 06:33:00,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 06:33:00,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:33:00,035 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 06:33:00,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:33:00,035 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 06:33:00,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 06:33:00,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:33:00,036 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 06:33:00,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 06:33:00,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:33:00,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:33:00,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:33:00,239 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 06:33:00,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:33:00,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900674140] [2024-10-11 06:33:00,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:33:00,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:33:00,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:33:00,244 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:33:00,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 06:33:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:33:01,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 06:33:01,271 INFO L278 TraceCheckSpWp]: Computing forward predicates...