./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2e2a2cb2c4789cd68b1190dca921718c27be66a014c5b9afd684fc837ce3e158 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:14:30,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:14:30,843 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 02:14:30,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:14:30,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:14:30,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:14:30,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:14:30,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:14:30,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:14:30,882 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:14:30,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:14:30,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:14:30,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:14:30,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:14:30,887 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:14:30,887 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:14:30,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:14:30,888 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 02:14:30,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:14:30,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:14:30,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:14:30,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:14:30,894 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:14:30,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:14:30,894 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:14:30,894 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:14:30,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:14:30,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:14:30,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:14:30,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:14:30,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:14:30,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:14:30,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:14:30,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 02:14:30,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 02:14:30,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:14:30,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:14:30,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:14:30,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:14:30,900 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e2a2cb2c4789cd68b1190dca921718c27be66a014c5b9afd684fc837ce3e158 [2024-11-10 02:14:31,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:14:31,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:14:31,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:14:31,185 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:14:31,185 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:14:31,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c [2024-11-10 02:14:32,714 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:14:32,967 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:14:32,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c [2024-11-10 02:14:32,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/470ca71b7/62c9b1ffda104e209af3ab30789d0a61/FLAG0830af9e9 [2024-11-10 02:14:33,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/470ca71b7/62c9b1ffda104e209af3ab30789d0a61 [2024-11-10 02:14:33,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:14:33,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:14:33,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:14:33,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:14:33,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:14:33,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:14:33" (1/1) ... [2024-11-10 02:14:33,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60ed510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:33, skipping insertion in model container [2024-11-10 02:14:33,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:14:33" (1/1) ... [2024-11-10 02:14:33,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:14:33,539 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c[1172,1185] [2024-11-10 02:14:33,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:14:33,823 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:14:33,833 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c[1172,1185] [2024-11-10 02:14:34,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:14:34,080 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:14:34,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:34 WrapperNode [2024-11-10 02:14:34,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:14:34,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:14:34,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:14:34,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:14:34,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:34" (1/1) ... [2024-11-10 02:14:34,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:34" (1/1) ... [2024-11-10 02:14:34,462 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3251 [2024-11-10 02:14:34,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:14:34,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:14:34,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:14:34,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:14:34,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:34" (1/1) ... [2024-11-10 02:14:34,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:34" (1/1) ... [2024-11-10 02:14:34,554 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:34" (1/1) ... [2024-11-10 02:14:34,666 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 02:14:34,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:34" (1/1) ... [2024-11-10 02:14:34,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:34" (1/1) ... [2024-11-10 02:14:34,910 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:34" (1/1) ... [2024-11-10 02:14:34,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:34" (1/1) ... [2024-11-10 02:14:34,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:34" (1/1) ... [2024-11-10 02:14:35,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:34" (1/1) ... [2024-11-10 02:14:35,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:14:35,226 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:14:35,226 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:14:35,227 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:14:35,227 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:34" (1/1) ... [2024-11-10 02:14:35,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:14:35,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:14:35,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 02:14:35,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 02:14:35,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:14:35,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 02:14:35,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:14:35,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:14:35,601 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:14:35,603 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:14:38,944 INFO L? ?]: Removed 1863 outVars from TransFormulas that were not future-live. [2024-11-10 02:14:38,945 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:14:39,134 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:14:39,134 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:14:39,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:14:39 BoogieIcfgContainer [2024-11-10 02:14:39,135 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:14:39,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:14:39,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:14:39,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:14:39,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:14:33" (1/3) ... [2024-11-10 02:14:39,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81bb918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:14:39, skipping insertion in model container [2024-11-10 02:14:39,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:34" (2/3) ... [2024-11-10 02:14:39,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81bb918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:14:39, skipping insertion in model container [2024-11-10 02:14:39,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:14:39" (3/3) ... [2024-11-10 02:14:39,145 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.krebs.1.prop1-func-interl.c [2024-11-10 02:14:39,164 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:14:39,165 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:14:39,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:14:39,273 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;@4aeaf0b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:14:39,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:14:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 1081 states, 1079 states have (on average 1.505097312326228) internal successors, (1624), 1080 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:39,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 02:14:39,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:14:39,298 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] [2024-11-10 02:14:39,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:14:39,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:14:39,306 INFO L85 PathProgramCache]: Analyzing trace with hash 543708233, now seen corresponding path program 1 times [2024-11-10 02:14:39,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:14:39,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262062339] [2024-11-10 02:14:39,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:14:39,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:14:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:14:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:14:40,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:14:40,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262062339] [2024-11-10 02:14:40,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262062339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:14:40,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:14:40,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:14:40,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637001306] [2024-11-10 02:14:40,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:14:40,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:14:40,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:14:40,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:14:40,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:14:40,238 INFO L87 Difference]: Start difference. First operand has 1081 states, 1079 states have (on average 1.505097312326228) internal successors, (1624), 1080 states have internal predecessors, (1624), 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 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:40,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:14:40,882 INFO L93 Difference]: Finished difference Result 2053 states and 3089 transitions. [2024-11-10 02:14:40,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:14:40,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 88 [2024-11-10 02:14:40,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:14:40,916 INFO L225 Difference]: With dead ends: 2053 [2024-11-10 02:14:40,916 INFO L226 Difference]: Without dead ends: 1078 [2024-11-10 02:14:40,924 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-11-10 02:14:40,928 INFO L432 NwaCegarLoop]: 1353 mSDtfsCounter, 0 mSDsluCounter, 2701 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4054 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 02:14:40,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4054 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 02:14:40,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2024-11-10 02:14:41,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1078. [2024-11-10 02:14:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 1.5041782729805013) internal successors, (1620), 1077 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:41,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1620 transitions. [2024-11-10 02:14:41,024 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1620 transitions. Word has length 88 [2024-11-10 02:14:41,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:14:41,025 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1620 transitions. [2024-11-10 02:14:41,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:41,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1620 transitions. [2024-11-10 02:14:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 02:14:41,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:14:41,030 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] [2024-11-10 02:14:41,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 02:14:41,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:14:41,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:14:41,032 INFO L85 PathProgramCache]: Analyzing trace with hash -179858998, now seen corresponding path program 1 times [2024-11-10 02:14:41,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:14:41,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034610870] [2024-11-10 02:14:41,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:14:41,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:14:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:14:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:14:41,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:14:41,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034610870] [2024-11-10 02:14:41,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034610870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:14:41,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:14:41,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:14:41,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622726169] [2024-11-10 02:14:41,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:14:41,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:14:41,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:14:41,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:14:41,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:14:41,276 INFO L87 Difference]: Start difference. First operand 1078 states and 1620 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:14:41,861 INFO L93 Difference]: Finished difference Result 2052 states and 3085 transitions. [2024-11-10 02:14:41,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:14:41,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 89 [2024-11-10 02:14:41,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:14:41,866 INFO L225 Difference]: With dead ends: 2052 [2024-11-10 02:14:41,867 INFO L226 Difference]: Without dead ends: 1080 [2024-11-10 02:14:41,868 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-11-10 02:14:41,870 INFO L432 NwaCegarLoop]: 1353 mSDtfsCounter, 0 mSDsluCounter, 2698 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4051 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 02:14:41,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4051 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 02:14:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2024-11-10 02:14:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1080. [2024-11-10 02:14:41,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1079 states have (on average 1.5032437442075997) internal successors, (1622), 1079 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:41,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1622 transitions. [2024-11-10 02:14:41,897 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1622 transitions. Word has length 89 [2024-11-10 02:14:41,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:14:41,898 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1622 transitions. [2024-11-10 02:14:41,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1622 transitions. [2024-11-10 02:14:41,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 02:14:41,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:14:41,901 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] [2024-11-10 02:14:41,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 02:14:41,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:14:41,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:14:41,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1533416498, now seen corresponding path program 1 times [2024-11-10 02:14:41,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:14:41,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403181431] [2024-11-10 02:14:41,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:14:41,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:14:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:14:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:14:42,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:14:42,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403181431] [2024-11-10 02:14:42,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403181431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:14:42,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:14:42,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:14:42,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447567820] [2024-11-10 02:14:42,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:14:42,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:14:42,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:14:42,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:14:42,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:14:42,201 INFO L87 Difference]: Start difference. First operand 1080 states and 1622 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:14:42,736 INFO L93 Difference]: Finished difference Result 2060 states and 3095 transitions. [2024-11-10 02:14:42,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:14:42,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 90 [2024-11-10 02:14:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:14:42,741 INFO L225 Difference]: With dead ends: 2060 [2024-11-10 02:14:42,742 INFO L226 Difference]: Without dead ends: 1086 [2024-11-10 02:14:42,743 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-11-10 02:14:42,745 INFO L432 NwaCegarLoop]: 1353 mSDtfsCounter, 4 mSDsluCounter, 2693 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4046 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 02:14:42,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4046 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 02:14:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2024-11-10 02:14:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1086. [2024-11-10 02:14:42,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 1.5023041474654377) internal successors, (1630), 1085 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:42,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1630 transitions. [2024-11-10 02:14:42,774 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1630 transitions. Word has length 90 [2024-11-10 02:14:42,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:14:42,775 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1630 transitions. [2024-11-10 02:14:42,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:42,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1630 transitions. [2024-11-10 02:14:42,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 02:14:42,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:14:42,777 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] [2024-11-10 02:14:42,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 02:14:42,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:14:42,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:14:42,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1224828032, now seen corresponding path program 1 times [2024-11-10 02:14:42,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:14:42,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10016352] [2024-11-10 02:14:42,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:14:42,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:14:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:14:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:14:43,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:14:43,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10016352] [2024-11-10 02:14:43,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10016352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:14:43,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:14:43,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:14:43,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009920668] [2024-11-10 02:14:43,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:14:43,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:14:43,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:14:43,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:14:43,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:14:43,018 INFO L87 Difference]: Start difference. First operand 1086 states and 1630 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:14:43,530 INFO L93 Difference]: Finished difference Result 2070 states and 3107 transitions. [2024-11-10 02:14:43,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:14:43,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 91 [2024-11-10 02:14:43,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:14:43,536 INFO L225 Difference]: With dead ends: 2070 [2024-11-10 02:14:43,537 INFO L226 Difference]: Without dead ends: 1090 [2024-11-10 02:14:43,540 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-11-10 02:14:43,541 INFO L432 NwaCegarLoop]: 1353 mSDtfsCounter, 0 mSDsluCounter, 2693 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4046 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 02:14:43,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4046 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 02:14:43,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2024-11-10 02:14:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1086. [2024-11-10 02:14:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 1.5023041474654377) internal successors, (1630), 1085 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:43,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1630 transitions. [2024-11-10 02:14:43,566 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1630 transitions. Word has length 91 [2024-11-10 02:14:43,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:14:43,567 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1630 transitions. [2024-11-10 02:14:43,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:43,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1630 transitions. [2024-11-10 02:14:43,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 02:14:43,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:14:43,569 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] [2024-11-10 02:14:43,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 02:14:43,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:14:43,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:14:43,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2019627603, now seen corresponding path program 1 times [2024-11-10 02:14:43,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:14:43,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646016915] [2024-11-10 02:14:43,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:14:43,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:14:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:14:43,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:14:43,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:14:43,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646016915] [2024-11-10 02:14:43,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646016915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:14:43,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:14:43,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:14:43,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420528465] [2024-11-10 02:14:43,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:14:43,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:14:43,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:14:43,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:14:43,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:14:43,896 INFO L87 Difference]: Start difference. First operand 1086 states and 1630 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:45,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:14:45,502 INFO L93 Difference]: Finished difference Result 3030 states and 4550 transitions. [2024-11-10 02:14:45,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:14:45,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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 92 [2024-11-10 02:14:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:14:45,511 INFO L225 Difference]: With dead ends: 3030 [2024-11-10 02:14:45,512 INFO L226 Difference]: Without dead ends: 2050 [2024-11-10 02:14:45,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-11-10 02:14:45,515 INFO L432 NwaCegarLoop]: 1094 mSDtfsCounter, 1522 mSDsluCounter, 3169 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 4263 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 02:14:45,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 4263 Invalid, 2053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2052 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 02:14:45,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2024-11-10 02:14:45,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1133. [2024-11-10 02:14:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.5008833922261484) internal successors, (1699), 1132 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:45,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1699 transitions. [2024-11-10 02:14:45,545 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1699 transitions. Word has length 92 [2024-11-10 02:14:45,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:14:45,546 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1699 transitions. [2024-11-10 02:14:45,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:45,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1699 transitions. [2024-11-10 02:14:45,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 02:14:45,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:14:45,548 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] [2024-11-10 02:14:45,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 02:14:45,549 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:14:45,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:14:45,549 INFO L85 PathProgramCache]: Analyzing trace with hash -900417503, now seen corresponding path program 1 times [2024-11-10 02:14:45,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:14:45,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100733184] [2024-11-10 02:14:45,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:14:45,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:14:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:14:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:14:45,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:14:45,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100733184] [2024-11-10 02:14:45,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100733184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:14:45,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:14:45,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:14:45,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146827460] [2024-11-10 02:14:45,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:14:45,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:14:45,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:14:45,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:14:45,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:14:45,779 INFO L87 Difference]: Start difference. First operand 1133 states and 1699 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:14:46,876 INFO L93 Difference]: Finished difference Result 2113 states and 3171 transitions. [2024-11-10 02:14:46,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:14:46,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 93 [2024-11-10 02:14:46,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:14:46,881 INFO L225 Difference]: With dead ends: 2113 [2024-11-10 02:14:46,882 INFO L226 Difference]: Without dead ends: 1133 [2024-11-10 02:14:46,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:14:46,885 INFO L432 NwaCegarLoop]: 1086 mSDtfsCounter, 1534 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 1591 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 02:14:46,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 3249 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 02:14:46,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2024-11-10 02:14:46,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1133. [2024-11-10 02:14:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.4973498233215548) internal successors, (1695), 1132 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:46,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1695 transitions. [2024-11-10 02:14:46,910 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1695 transitions. Word has length 93 [2024-11-10 02:14:46,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:14:46,910 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1695 transitions. [2024-11-10 02:14:46,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:46,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1695 transitions. [2024-11-10 02:14:46,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 02:14:46,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:14:46,912 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] [2024-11-10 02:14:46,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 02:14:46,912 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:14:46,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:14:46,913 INFO L85 PathProgramCache]: Analyzing trace with hash 192058054, now seen corresponding path program 1 times [2024-11-10 02:14:46,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:14:46,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604858936] [2024-11-10 02:14:46,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:14:46,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:14:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 02:14:46,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 02:14:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 02:14:47,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 02:14:47,068 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 02:14:47,069 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 02:14:47,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 02:14:47,077 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:14:47,157 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 02:14:47,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:14:47 BoogieIcfgContainer [2024-11-10 02:14:47,169 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 02:14:47,169 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 02:14:47,169 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 02:14:47,169 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 02:14:47,170 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:14:39" (3/4) ... [2024-11-10 02:14:47,174 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 02:14:47,178 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 02:14:47,179 INFO L158 Benchmark]: Toolchain (without parser) took 13891.97ms. Allocated memory was 159.4MB in the beginning and 530.6MB in the end (delta: 371.2MB). Free memory was 102.4MB in the beginning and 330.6MB in the end (delta: -228.2MB). Peak memory consumption was 146.1MB. Max. memory is 16.1GB. [2024-11-10 02:14:47,180 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory was 119.9MB in the beginning and 119.7MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 02:14:47,181 INFO L158 Benchmark]: CACSL2BoogieTranslator took 792.70ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 102.4MB in the beginning and 169.3MB in the end (delta: -66.9MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2024-11-10 02:14:47,181 INFO L158 Benchmark]: Boogie Procedure Inliner took 381.22ms. Allocated memory is still 220.2MB. Free memory was 169.3MB in the beginning and 88.6MB in the end (delta: 80.7MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-11-10 02:14:47,183 INFO L158 Benchmark]: Boogie Preprocessor took 761.36ms. Allocated memory is still 220.2MB. Free memory was 88.6MB in the beginning and 117.7MB in the end (delta: -29.2MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. [2024-11-10 02:14:47,183 INFO L158 Benchmark]: IcfgBuilder took 3909.18ms. Allocated memory was 220.2MB in the beginning and 440.4MB in the end (delta: 220.2MB). Free memory was 117.7MB in the beginning and 167.1MB in the end (delta: -49.4MB). Peak memory consumption was 219.2MB. Max. memory is 16.1GB. [2024-11-10 02:14:47,184 INFO L158 Benchmark]: TraceAbstraction took 8031.31ms. Allocated memory was 440.4MB in the beginning and 530.6MB in the end (delta: 90.2MB). Free memory was 166.1MB in the beginning and 330.6MB in the end (delta: -164.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 02:14:47,184 INFO L158 Benchmark]: Witness Printer took 9.06ms. Allocated memory is still 530.6MB. Free memory is still 330.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 02:14:47,191 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.21ms. Allocated memory is still 159.4MB. Free memory was 119.9MB in the beginning and 119.7MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 792.70ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 102.4MB in the beginning and 169.3MB in the end (delta: -66.9MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 381.22ms. Allocated memory is still 220.2MB. Free memory was 169.3MB in the beginning and 88.6MB in the end (delta: 80.7MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 761.36ms. Allocated memory is still 220.2MB. Free memory was 88.6MB in the beginning and 117.7MB in the end (delta: -29.2MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. * IcfgBuilder took 3909.18ms. Allocated memory was 220.2MB in the beginning and 440.4MB in the end (delta: 220.2MB). Free memory was 117.7MB in the beginning and 167.1MB in the end (delta: -49.4MB). Peak memory consumption was 219.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8031.31ms. Allocated memory was 440.4MB in the beginning and 530.6MB in the end (delta: 90.2MB). Free memory was 166.1MB in the beginning and 330.6MB in the end (delta: -164.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 9.06ms. Allocated memory is still 530.6MB. Free memory is still 330.6MB. 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 173. 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_3 var_59 = 0; [L41] const SORT_4 var_61 = 5; [L42] const SORT_2 var_65 = 2; [L43] const SORT_4 var_69 = 1; [L44] const SORT_2 var_75 = 4; [L45] const SORT_4 var_77 = 2; [L46] const SORT_2 var_101 = 12; [L47] const SORT_2 var_154 = 15; [L48] const SORT_2 var_169 = 10; [L50] SORT_1 input_66; [L51] SORT_1 input_76; [L52] SORT_1 input_82; [L53] SORT_1 input_106; [L54] SORT_1 input_109; [L55] SORT_1 input_110; [L56] SORT_1 input_126; [L57] SORT_1 input_145; [L58] SORT_1 input_187; [L59] SORT_1 input_208; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L61] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L62] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L63] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L64] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L65] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L66] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L67] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L68] SORT_2 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L69] SORT_2 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L70] SORT_2 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L71] SORT_2 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L72] SORT_2 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L73] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L74] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L75] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L76] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L77] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L78] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L79] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L80] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L81] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L82] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L83] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L84] SORT_1 state_53 = __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=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L85] SORT_1 state_55 = __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=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L86] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] SORT_2 init_7_arg_1 = var_5; [L89] state_6 = init_7_arg_1 [L90] SORT_2 init_9_arg_1 = var_5; [L91] state_8 = init_9_arg_1 [L92] SORT_2 init_11_arg_1 = var_5; [L93] state_10 = init_11_arg_1 [L94] SORT_2 init_13_arg_1 = var_5; [L95] state_12 = init_13_arg_1 [L96] SORT_2 init_15_arg_1 = var_5; [L97] state_14 = init_15_arg_1 [L98] SORT_2 init_17_arg_1 = var_5; [L99] state_16 = init_17_arg_1 [L100] SORT_2 init_19_arg_1 = var_5; [L101] state_18 = init_19_arg_1 [L102] SORT_2 init_21_arg_1 = var_5; [L103] state_20 = init_21_arg_1 [L104] SORT_2 init_23_arg_1 = var_5; [L105] state_22 = init_23_arg_1 [L106] SORT_2 init_25_arg_1 = var_5; [L107] state_24 = init_25_arg_1 [L108] SORT_2 init_27_arg_1 = var_5; [L109] state_26 = init_27_arg_1 [L110] SORT_2 init_29_arg_1 = var_5; [L111] state_28 = init_29_arg_1 [L112] SORT_1 init_32_arg_1 = var_30; [L113] state_31 = init_32_arg_1 [L114] SORT_1 init_34_arg_1 = var_30; [L115] state_33 = init_34_arg_1 [L116] SORT_1 init_36_arg_1 = var_30; [L117] state_35 = init_36_arg_1 [L118] SORT_1 init_38_arg_1 = var_30; [L119] state_37 = init_38_arg_1 [L120] SORT_1 init_40_arg_1 = var_30; [L121] state_39 = init_40_arg_1 [L122] SORT_1 init_42_arg_1 = var_30; [L123] state_41 = init_42_arg_1 [L124] SORT_1 init_44_arg_1 = var_30; [L125] state_43 = init_44_arg_1 [L126] SORT_1 init_46_arg_1 = var_30; [L127] state_45 = init_46_arg_1 [L128] SORT_1 init_48_arg_1 = var_30; [L129] state_47 = init_48_arg_1 [L130] SORT_1 init_50_arg_1 = var_30; [L131] state_49 = init_50_arg_1 [L132] SORT_1 init_52_arg_1 = var_30; [L133] state_51 = init_52_arg_1 [L134] SORT_1 init_54_arg_1 = var_30; [L135] state_53 = init_54_arg_1 [L136] SORT_1 init_56_arg_1 = var_30; [L137] state_55 = init_56_arg_1 [L138] SORT_1 init_58_arg_1 = var_30; [L139] state_57 = init_58_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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L142] input_66 = __VERIFIER_nondet_uchar() [L143] EXPR input_66 & 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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L143] input_66 = input_66 & mask_SORT_1 [L144] input_76 = __VERIFIER_nondet_uchar() [L145] EXPR input_76 & mask_SORT_1 VAL [input_66=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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L145] input_76 = input_76 & mask_SORT_1 [L146] input_82 = __VERIFIER_nondet_uchar() [L147] EXPR input_82 & mask_SORT_1 VAL [input_66=0, input_76=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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L147] input_82 = input_82 & mask_SORT_1 [L148] input_106 = __VERIFIER_nondet_uchar() [L149] EXPR input_106 & mask_SORT_1 VAL [input_66=0, input_76=0, input_82=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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L149] input_106 = input_106 & mask_SORT_1 [L150] input_109 = __VERIFIER_nondet_uchar() [L151] EXPR input_109 & mask_SORT_1 VAL [input_106=0, input_66=0, input_76=0, input_82=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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L151] input_109 = input_109 & mask_SORT_1 [L152] input_110 = __VERIFIER_nondet_uchar() [L153] EXPR input_110 & mask_SORT_1 VAL [input_106=0, input_109=0, input_66=0, input_76=0, input_82=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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L153] input_110 = input_110 & mask_SORT_1 [L154] input_126 = __VERIFIER_nondet_uchar() [L155] EXPR input_126 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_66=0, input_76=0, input_82=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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L155] input_126 = input_126 & mask_SORT_1 [L156] input_145 = __VERIFIER_nondet_uchar() [L157] EXPR input_145 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_66=0, input_76=0, input_82=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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L157] input_145 = input_145 & mask_SORT_1 [L158] input_187 = __VERIFIER_nondet_uchar() [L159] EXPR input_187 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_66=0, input_76=0, input_82=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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L159] input_187 = input_187 & mask_SORT_1 [L160] input_208 = __VERIFIER_nondet_uchar() [L163] SORT_3 var_60_arg_0 = var_59; [L164] SORT_2 var_60_arg_1 = state_28; VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60_arg_0=0, var_60_arg_1=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L165] EXPR ((SORT_4)var_60_arg_0 << 8) | var_60_arg_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L165] SORT_4 var_60 = ((SORT_4)var_60_arg_0 << 8) | var_60_arg_1; [L166] EXPR var_60 & mask_SORT_4 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L166] var_60 = var_60 & mask_SORT_4 [L167] SORT_4 var_62_arg_0 = var_60; [L168] SORT_4 var_62_arg_1 = var_61; [L169] SORT_1 var_62 = var_62_arg_0 <= var_62_arg_1; [L170] SORT_1 var_63_arg_0 = ~state_57; VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_62=1, var_63_arg_0=-1, var_65=2, var_69=1, var_75=4, var_77=2] [L171] EXPR var_63_arg_0 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_62=1, var_65=2, var_69=1, var_75=4, var_77=2] [L171] var_63_arg_0 = var_63_arg_0 & mask_SORT_1 [L172] SORT_1 var_63_arg_1 = ~var_62; VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_63_arg_0=1, var_63_arg_1=-2, var_65=2, var_69=1, var_75=4, var_77=2] [L173] EXPR var_63_arg_1 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_63_arg_0=1, var_65=2, var_69=1, var_75=4, var_77=2] [L173] var_63_arg_1 = var_63_arg_1 & mask_SORT_1 [L174] EXPR var_63_arg_0 & var_63_arg_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L174] SORT_1 var_63 = var_63_arg_0 & var_63_arg_1; [L175] EXPR var_63 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=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_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L175] var_63 = var_63 & mask_SORT_1 [L176] SORT_1 bad_64_arg_0 = var_63; [L177] CALL __VERIFIER_assert(!(bad_64_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1081 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3060 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3060 mSDsluCounter, 23709 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16117 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6859 IncrementalHoareTripleChecker+Invalid, 6862 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 7592 mSDtfsCounter, 6859 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1133occurred 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.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 921 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 637 NumberOfCodeBlocks, 637 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 537 ConstructedInterpolants, 0 QuantifiedInterpolants, 1234 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-11-10 02:14:47,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2e2a2cb2c4789cd68b1190dca921718c27be66a014c5b9afd684fc837ce3e158 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:14:49,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:14:49,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 02:14:49,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:14:49,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:14:49,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:14:49,703 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:14:49,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:14:49,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:14:49,705 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:14:49,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:14:49,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:14:49,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:14:49,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:14:49,709 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:14:49,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:14:49,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:14:49,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:14:49,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:14:49,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:14:49,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:14:49,715 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 02:14:49,716 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 02:14:49,716 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:14:49,716 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 02:14:49,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:14:49,717 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:14:49,717 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:14:49,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:14:49,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:14:49,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:14:49,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:14:49,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:14:49,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:14:49,719 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:14:49,719 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 02:14:49,719 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 02:14:49,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:14:49,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:14:49,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:14:49,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:14:49,721 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e2a2cb2c4789cd68b1190dca921718c27be66a014c5b9afd684fc837ce3e158 [2024-11-10 02:14:50,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:14:50,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:14:50,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:14:50,089 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:14:50,089 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:14:50,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c [2024-11-10 02:14:51,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:14:51,985 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:14:51,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c [2024-11-10 02:14:52,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4c17df3c/3a2e4ea4d61b49989edc1a3f03c67a50/FLAG33a6e33b6 [2024-11-10 02:14:52,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4c17df3c/3a2e4ea4d61b49989edc1a3f03c67a50 [2024-11-10 02:14:52,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:14:52,040 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:14:52,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:14:52,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:14:52,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:14:52,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:14:52" (1/1) ... [2024-11-10 02:14:52,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c9fbc04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:52, skipping insertion in model container [2024-11-10 02:14:52,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:14:52" (1/1) ... [2024-11-10 02:14:52,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:14:52,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c[1172,1185] [2024-11-10 02:14:52,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:14:52,608 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:14:52,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c[1172,1185] [2024-11-10 02:14:52,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:14:52,741 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:14:52,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:52 WrapperNode [2024-11-10 02:14:52,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:14:52,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:14:52,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:14:52,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:14:52,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:52" (1/1) ... [2024-11-10 02:14:52,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:52" (1/1) ... [2024-11-10 02:14:52,888 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1115 [2024-11-10 02:14:52,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:14:52,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:14:52,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:14:52,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:14:52,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:52" (1/1) ... [2024-11-10 02:14:52,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:52" (1/1) ... [2024-11-10 02:14:52,911 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:52" (1/1) ... [2024-11-10 02:14:52,962 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 02:14:52,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:52" (1/1) ... [2024-11-10 02:14:52,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:52" (1/1) ... [2024-11-10 02:14:53,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:52" (1/1) ... [2024-11-10 02:14:53,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:52" (1/1) ... [2024-11-10 02:14:53,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:52" (1/1) ... [2024-11-10 02:14:53,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:52" (1/1) ... [2024-11-10 02:14:53,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:14:53,049 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:14:53,050 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:14:53,050 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:14:53,051 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:52" (1/1) ... [2024-11-10 02:14:53,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:14:53,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:14:53,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 02:14:53,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 02:14:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:14:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 02:14:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:14:53,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:14:53,392 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:14:53,395 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:14:54,446 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-11-10 02:14:54,446 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:14:54,458 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:14:54,459 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:14:54,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:14:54 BoogieIcfgContainer [2024-11-10 02:14:54,460 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:14:54,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:14:54,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:14:54,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:14:54,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:14:52" (1/3) ... [2024-11-10 02:14:54,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66df347d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:14:54, skipping insertion in model container [2024-11-10 02:14:54,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:14:52" (2/3) ... [2024-11-10 02:14:54,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66df347d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:14:54, skipping insertion in model container [2024-11-10 02:14:54,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:14:54" (3/3) ... [2024-11-10 02:14:54,472 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.krebs.1.prop1-func-interl.c [2024-11-10 02:14:54,489 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:14:54,490 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:14:54,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:14:54,554 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;@3b72a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:14:54,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:14:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 02:14:54,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:14:54,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 02:14:54,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:14:54,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:14:54,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 02:14:54,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:14:54,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114527620] [2024-11-10 02:14:54,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:14:54,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:14:54,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:14:54,597 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 02:14:54,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 02:14:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:14:54,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 02:14:54,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:14:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:14:55,104 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 02:14:55,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 02:14:55,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114527620] [2024-11-10 02:14:55,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114527620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:14:55,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:14:55,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:14:55,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414292453] [2024-11-10 02:14:55,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:14:55,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:14:55,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 02:14:55,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:14:55,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:14:55,137 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:55,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:14:55,244 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-10 02:14:55,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:14:55,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-11-10 02:14:55,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:14:55,254 INFO L225 Difference]: With dead ends: 22 [2024-11-10 02:14:55,254 INFO L226 Difference]: Without dead ends: 11 [2024-11-10 02:14:55,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:14:55,260 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:14:55,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:14:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-10 02:14:55,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-10 02:14:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 02:14:55,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 02:14:55,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:14:55,294 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 02:14:55,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:14:55,295 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 02:14:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 02:14:55,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:14:55,296 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:14:55,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 02:14:55,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:14:55,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:14:55,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:14:55,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 02:14:55,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:14:55,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941414265] [2024-11-10 02:14:55,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:14:55,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:14:55,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:14:55,502 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 02:14:55,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 02:14:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:14:55,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 02:14:55,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:14:56,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:14:56,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:15:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:15:06,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 02:15:06,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941414265] [2024-11-10 02:15:06,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941414265] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 02:15:06,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 02:15:06,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-10 02:15:06,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432511736] [2024-11-10 02:15:06,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 02:15:06,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 02:15:06,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 02:15:06,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 02:15:06,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=60, Unknown=2, NotChecked=0, Total=90 [2024-11-10 02:15:06,114 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:15:09,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:15:09,490 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-11-10 02:15:09,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 02:15:09,491 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 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 9 [2024-11-10 02:15:09,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:15:09,491 INFO L225 Difference]: With dead ends: 20 [2024-11-10 02:15:09,491 INFO L226 Difference]: Without dead ends: 17 [2024-11-10 02:15:09,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=73, Invalid=135, Unknown=2, NotChecked=0, Total=210 [2024-11-10 02:15:09,493 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:15:09,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 02:15:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-10 02:15:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-11-10 02:15:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:15:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-11-10 02:15:09,498 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2024-11-10 02:15:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:15:09,499 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-11-10 02:15:09,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:15:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-11-10 02:15:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 02:15:09,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:15:09,500 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2024-11-10 02:15:09,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 02:15:09,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:15:09,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:15:09,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:15:09,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1989777505, now seen corresponding path program 2 times [2024-11-10 02:15:09,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:15:09,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704082151] [2024-11-10 02:15:09,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 02:15:09,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:15:09,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:15:09,711 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 02:15:09,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 02:15:10,389 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 02:15:10,389 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 02:15:10,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 02:15:10,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:15:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:15:17,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:15:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:15:30,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 02:15:30,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704082151] [2024-11-10 02:15:30,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704082151] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 02:15:30,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 02:15:30,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-10 02:15:30,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526220997] [2024-11-10 02:15:30,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 02:15:30,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 02:15:30,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 02:15:30,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 02:15:30,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2024-11-10 02:15:30,799 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:15:39,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:15:39,525 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-11-10 02:15:39,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 02:15:39,526 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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 15 [2024-11-10 02:15:39,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:15:39,527 INFO L225 Difference]: With dead ends: 29 [2024-11-10 02:15:39,527 INFO L226 Difference]: Without dead ends: 26 [2024-11-10 02:15:39,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=241, Invalid=515, Unknown=0, NotChecked=0, Total=756 [2024-11-10 02:15:39,528 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 02:15:39,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 42 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 02:15:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-10 02:15:39,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-10 02:15:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:15:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-11-10 02:15:39,538 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 15 [2024-11-10 02:15:39,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:15:39,538 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2024-11-10 02:15:39,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:15:39,538 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-11-10 02:15:39,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 02:15:39,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:15:39,539 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1] [2024-11-10 02:15:39,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 02:15:39,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:15:39,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:15:39,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:15:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash 610152573, now seen corresponding path program 3 times [2024-11-10 02:15:39,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:15:39,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787224378] [2024-11-10 02:15:39,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 02:15:39,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 02:15:39,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:15:39,746 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 02:15:39,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 02:15:41,925 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-10 02:15:41,925 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 02:15:41,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-10 02:15:41,980 INFO L278 TraceCheckSpWp]: Computing forward predicates...