./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.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.cal2.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 e845250638bf2269b9610642a85a2d027126b83f570f70da1feb220fdec8c1ec --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:39:15,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:39:15,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 01:39:15,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:39:15,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:39:15,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:39:15,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:39:15,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:39:15,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:39:15,129 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:39:15,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:39:15,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:39:15,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:39:15,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:39:15,130 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:39:15,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:39:15,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:39:15,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:39:15,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:39:15,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:39:15,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:39:15,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:39:15,139 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:39:15,139 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:39:15,139 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:39:15,139 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:39:15,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:39:15,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:39:15,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:39:15,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:39:15,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:39:15,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:39:15,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:39:15,141 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:39:15,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:39:15,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:39:15,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:39:15,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:39:15,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:39:15,145 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 -> e845250638bf2269b9610642a85a2d027126b83f570f70da1feb220fdec8c1ec [2024-11-10 01:39:15,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:39:15,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:39:15,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:39:15,426 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:39:15,426 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:39:15,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.c [2024-11-10 01:39:16,842 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:39:17,105 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:39:17,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.c [2024-11-10 01:39:17,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663d40d9f/f6b9e4d218b343dc9c28a17011ab166e/FLAGecba9affb [2024-11-10 01:39:17,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663d40d9f/f6b9e4d218b343dc9c28a17011ab166e [2024-11-10 01:39:17,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:39:17,410 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:39:17,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:39:17,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:39:17,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:39:17,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:39:17" (1/1) ... [2024-11-10 01:39:17,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55aff0f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:17, skipping insertion in model container [2024-11-10 01:39:17,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:39:17" (1/1) ... [2024-11-10 01:39:17,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:39:17,719 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.cal2.c[1244,1257] [2024-11-10 01:39:17,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:39:17,981 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:39:17,995 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.cal2.c[1244,1257] [2024-11-10 01:39:18,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:39:18,153 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:39:18,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:18 WrapperNode [2024-11-10 01:39:18,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:39:18,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:39:18,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:39:18,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:39:18,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:18" (1/1) ... [2024-11-10 01:39:18,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:18" (1/1) ... [2024-11-10 01:39:18,392 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2327 [2024-11-10 01:39:18,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:39:18,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:39:18,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:39:18,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:39:18,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:18" (1/1) ... [2024-11-10 01:39:18,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:18" (1/1) ... [2024-11-10 01:39:18,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:18" (1/1) ... [2024-11-10 01:39:18,512 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-10 01:39:18,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:18" (1/1) ... [2024-11-10 01:39:18,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:18" (1/1) ... [2024-11-10 01:39:18,641 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:18" (1/1) ... [2024-11-10 01:39:18,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:18" (1/1) ... [2024-11-10 01:39:18,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:18" (1/1) ... [2024-11-10 01:39:18,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:18" (1/1) ... [2024-11-10 01:39:18,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:39:18,720 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:39:18,720 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:39:18,720 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:39:18,721 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:18" (1/1) ... [2024-11-10 01:39:18,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:39:18,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:39:18,755 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 01:39:18,813 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 01:39:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:39:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:39:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 01:39:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:39:18,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:39:19,123 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:39:19,127 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:39:21,154 INFO L? ?]: Removed 1306 outVars from TransFormulas that were not future-live. [2024-11-10 01:39:21,154 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:39:21,275 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:39:21,276 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:39:21,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:39:21 BoogieIcfgContainer [2024-11-10 01:39:21,279 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:39:21,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:39:21,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:39:21,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:39:21,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:39:17" (1/3) ... [2024-11-10 01:39:21,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e38eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:39:21, skipping insertion in model container [2024-11-10 01:39:21,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:18" (2/3) ... [2024-11-10 01:39:21,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e38eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:39:21, skipping insertion in model container [2024-11-10 01:39:21,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:39:21" (3/3) ... [2024-11-10 01:39:21,289 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal2.c [2024-11-10 01:39:21,305 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:39:21,306 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:39:21,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:39:21,438 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;@73f9b8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:39:21,439 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:39:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 513 states, 511 states have (on average 1.5068493150684932) internal successors, (770), 512 states have internal predecessors, (770), 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 01:39:21,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 01:39:21,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:39:21,460 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] [2024-11-10 01:39:21,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:39:21,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:39:21,468 INFO L85 PathProgramCache]: Analyzing trace with hash 100070965, now seen corresponding path program 1 times [2024-11-10 01:39:21,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:39:21,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77187230] [2024-11-10 01:39:21,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:39:21,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:39:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:39:22,333 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 01:39:22,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:39:22,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77187230] [2024-11-10 01:39:22,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77187230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:39:22,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:39:22,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:39:22,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595015524] [2024-11-10 01:39:22,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:39:22,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:39:22,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:39:22,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:39:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:39:22,372 INFO L87 Difference]: Start difference. First operand has 513 states, 511 states have (on average 1.5068493150684932) internal successors, (770), 512 states have internal predecessors, (770), 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 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 01:39:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:39:22,732 INFO L93 Difference]: Finished difference Result 901 states and 1357 transitions. [2024-11-10 01:39:22,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:39:22,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 80 [2024-11-10 01:39:22,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:39:22,752 INFO L225 Difference]: With dead ends: 901 [2024-11-10 01:39:22,752 INFO L226 Difference]: Without dead ends: 510 [2024-11-10 01:39:22,760 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 01:39:22,764 INFO L432 NwaCegarLoop]: 640 mSDtfsCounter, 0 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:39:22,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1915 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:39:22,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-11-10 01:39:22,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2024-11-10 01:39:22,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.5049115913555993) internal successors, (766), 509 states have internal predecessors, (766), 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 01:39:22,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 766 transitions. [2024-11-10 01:39:22,835 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 766 transitions. Word has length 80 [2024-11-10 01:39:22,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:39:22,836 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 766 transitions. [2024-11-10 01:39:22,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 01:39:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 766 transitions. [2024-11-10 01:39:22,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 01:39:22,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:39:22,841 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] [2024-11-10 01:39:22,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:39:22,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:39:22,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:39:22,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1047713385, now seen corresponding path program 1 times [2024-11-10 01:39:22,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:39:22,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803352418] [2024-11-10 01:39:22,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:39:22,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:39:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:39:23,136 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 01:39:23,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:39:23,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803352418] [2024-11-10 01:39:23,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803352418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:39:23,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:39:23,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:39:23,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333683771] [2024-11-10 01:39:23,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:39:23,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:39:23,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:39:23,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:39:23,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:39:23,141 INFO L87 Difference]: Start difference. First operand 510 states and 766 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 01:39:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:39:23,488 INFO L93 Difference]: Finished difference Result 900 states and 1353 transitions. [2024-11-10 01:39:23,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:39:23,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2024-11-10 01:39:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:39:23,492 INFO L225 Difference]: With dead ends: 900 [2024-11-10 01:39:23,492 INFO L226 Difference]: Without dead ends: 512 [2024-11-10 01:39:23,493 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 01:39:23,494 INFO L432 NwaCegarLoop]: 640 mSDtfsCounter, 0 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:39:23,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1912 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:39:23,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-11-10 01:39:23,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2024-11-10 01:39:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 1.5029354207436398) internal successors, (768), 511 states have internal predecessors, (768), 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 01:39:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 768 transitions. [2024-11-10 01:39:23,509 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 768 transitions. Word has length 81 [2024-11-10 01:39:23,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:39:23,509 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 768 transitions. [2024-11-10 01:39:23,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 01:39:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 768 transitions. [2024-11-10 01:39:23,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 01:39:23,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:39:23,512 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] [2024-11-10 01:39:23,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:39:23,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:39:23,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:39:23,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1627867610, now seen corresponding path program 1 times [2024-11-10 01:39:23,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:39:23,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217031426] [2024-11-10 01:39:23,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:39:23,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:39:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:39:24,025 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 01:39:24,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:39:24,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217031426] [2024-11-10 01:39:24,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217031426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:39:24,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:39:24,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:39:24,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224974555] [2024-11-10 01:39:24,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:39:24,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:39:24,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:39:24,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:39:24,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:39:24,035 INFO L87 Difference]: Start difference. First operand 512 states and 768 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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 01:39:24,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:39:24,531 INFO L93 Difference]: Finished difference Result 940 states and 1406 transitions. [2024-11-10 01:39:24,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:39:24,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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 82 [2024-11-10 01:39:24,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:39:24,534 INFO L225 Difference]: With dead ends: 940 [2024-11-10 01:39:24,535 INFO L226 Difference]: Without dead ends: 550 [2024-11-10 01:39:24,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:39:24,538 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 802 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 2517 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:39:24,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 2517 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:39:24,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-10 01:39:24,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 530. [2024-11-10 01:39:24,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 1.5009451795841209) internal successors, (794), 529 states have internal predecessors, (794), 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 01:39:24,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 794 transitions. [2024-11-10 01:39:24,563 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 794 transitions. Word has length 82 [2024-11-10 01:39:24,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:39:24,564 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 794 transitions. [2024-11-10 01:39:24,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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 01:39:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 794 transitions. [2024-11-10 01:39:24,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:39:24,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:39:24,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] [2024-11-10 01:39:24,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:39:24,570 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:39:24,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:39:24,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1628951666, now seen corresponding path program 1 times [2024-11-10 01:39:24,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:39:24,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884640066] [2024-11-10 01:39:24,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:39:24,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:39:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:39:24,972 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 01:39:24,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:39:24,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884640066] [2024-11-10 01:39:24,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884640066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:39:24,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:39:24,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:39:24,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310151457] [2024-11-10 01:39:24,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:39:24,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:39:24,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:39:24,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:39:24,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:39:24,978 INFO L87 Difference]: Start difference. First operand 530 states and 794 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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 01:39:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:39:25,649 INFO L93 Difference]: Finished difference Result 942 states and 1408 transitions. [2024-11-10 01:39:25,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:39:25,650 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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 83 [2024-11-10 01:39:25,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:39:25,652 INFO L225 Difference]: With dead ends: 942 [2024-11-10 01:39:25,653 INFO L226 Difference]: Without dead ends: 552 [2024-11-10 01:39:25,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-10 01:39:25,654 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 805 mSDsluCounter, 3136 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 3764 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:39:25,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 3764 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:39:25,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-10 01:39:25,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 533. [2024-11-10 01:39:25,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 1.5) internal successors, (798), 532 states have internal predecessors, (798), 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 01:39:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 798 transitions. [2024-11-10 01:39:25,669 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 798 transitions. Word has length 83 [2024-11-10 01:39:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:39:25,670 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 798 transitions. [2024-11-10 01:39:25,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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 01:39:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 798 transitions. [2024-11-10 01:39:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-10 01:39:25,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:39:25,674 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] [2024-11-10 01:39:25,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:39:25,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:39:25,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:39:25,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1551671205, now seen corresponding path program 1 times [2024-11-10 01:39:25,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:39:25,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56329906] [2024-11-10 01:39:25,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:39:25,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:39:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:39:26,347 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 01:39:26,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:39:26,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56329906] [2024-11-10 01:39:26,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56329906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:39:26,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:39:26,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:39:26,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528685534] [2024-11-10 01:39:26,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:39:26,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:39:26,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:39:26,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:39:26,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:39:26,352 INFO L87 Difference]: Start difference. First operand 533 states and 798 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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 01:39:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:39:27,216 INFO L93 Difference]: Finished difference Result 942 states and 1407 transitions. [2024-11-10 01:39:27,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:39:27,217 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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 84 [2024-11-10 01:39:27,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:39:27,220 INFO L225 Difference]: With dead ends: 942 [2024-11-10 01:39:27,220 INFO L226 Difference]: Without dead ends: 552 [2024-11-10 01:39:27,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:39:27,222 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 799 mSDsluCounter, 3748 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 4373 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 01:39:27,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 4373 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 01:39:27,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-10 01:39:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 537. [2024-11-10 01:39:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.498134328358209) internal successors, (803), 536 states have internal predecessors, (803), 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 01:39:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 803 transitions. [2024-11-10 01:39:27,234 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 803 transitions. Word has length 84 [2024-11-10 01:39:27,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:39:27,235 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 803 transitions. [2024-11-10 01:39:27,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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 01:39:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 803 transitions. [2024-11-10 01:39:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 01:39:27,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:39:27,237 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] [2024-11-10 01:39:27,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:39:27,238 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:39:27,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:39:27,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1799071769, now seen corresponding path program 1 times [2024-11-10 01:39:27,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:39:27,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874955036] [2024-11-10 01:39:27,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:39:27,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:39:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 01:39:27,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 01:39:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 01:39:27,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 01:39:27,407 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 01:39:27,409 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 01:39:27,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:39:27,415 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 01:39:27,504 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 01:39:27,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:39:27 BoogieIcfgContainer [2024-11-10 01:39:27,510 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 01:39:27,511 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 01:39:27,511 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 01:39:27,511 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 01:39:27,512 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:39:21" (3/4) ... [2024-11-10 01:39:27,514 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 01:39:27,516 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 01:39:27,516 INFO L158 Benchmark]: Toolchain (without parser) took 10105.84ms. Allocated memory was 172.0MB in the beginning and 455.1MB in the end (delta: 283.1MB). Free memory was 102.4MB in the beginning and 237.4MB in the end (delta: -134.9MB). Peak memory consumption was 148.9MB. Max. memory is 16.1GB. [2024-11-10 01:39:27,517 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 77.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 01:39:27,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 742.66ms. Allocated memory is still 172.0MB. Free memory was 102.2MB in the beginning and 106.6MB in the end (delta: -4.4MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-11-10 01:39:27,518 INFO L158 Benchmark]: Boogie Procedure Inliner took 237.66ms. Allocated memory is still 172.0MB. Free memory was 106.6MB in the beginning and 64.7MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-10 01:39:27,518 INFO L158 Benchmark]: Boogie Preprocessor took 325.44ms. Allocated memory is still 172.0MB. Free memory was 64.7MB in the beginning and 112.8MB in the end (delta: -48.1MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2024-11-10 01:39:27,518 INFO L158 Benchmark]: IcfgBuilder took 2559.19ms. Allocated memory was 172.0MB in the beginning and 285.2MB in the end (delta: 113.2MB). Free memory was 112.8MB in the beginning and 129.0MB in the end (delta: -16.2MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. [2024-11-10 01:39:27,518 INFO L158 Benchmark]: TraceAbstraction took 6229.30ms. Allocated memory was 285.2MB in the beginning and 455.1MB in the end (delta: 169.9MB). Free memory was 127.9MB in the beginning and 237.4MB in the end (delta: -109.5MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. [2024-11-10 01:39:27,519 INFO L158 Benchmark]: Witness Printer took 4.83ms. Allocated memory is still 455.1MB. Free memory is still 237.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 01:39:27,520 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.18ms. Allocated memory is still 113.2MB. Free memory is still 77.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 742.66ms. Allocated memory is still 172.0MB. Free memory was 102.2MB in the beginning and 106.6MB in the end (delta: -4.4MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 237.66ms. Allocated memory is still 172.0MB. Free memory was 106.6MB in the beginning and 64.7MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 325.44ms. Allocated memory is still 172.0MB. Free memory was 64.7MB in the beginning and 112.8MB in the end (delta: -48.1MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * IcfgBuilder took 2559.19ms. Allocated memory was 172.0MB in the beginning and 285.2MB in the end (delta: 113.2MB). Free memory was 112.8MB in the beginning and 129.0MB in the end (delta: -16.2MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6229.30ms. Allocated memory was 285.2MB in the beginning and 455.1MB in the end (delta: 169.9MB). Free memory was 127.9MB in the beginning and 237.4MB in the end (delta: -109.5MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. * Witness Printer took 4.83ms. Allocated memory is still 455.1MB. Free memory is still 237.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 270, overapproximation of bitwiseAnd at line 275. 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_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L30] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 4); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (4 - 1); [L35] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 64); [L36] const SORT_14 msb_SORT_14 = (SORT_14)1 << (64 - 1); [L38] const SORT_121 mask_SORT_121 = (SORT_121)-1 >> (sizeof(SORT_121) * 8 - 2); [L39] const SORT_121 msb_SORT_121 = (SORT_121)1 << (2 - 1); [L41] const SORT_1 var_56 = 0; [L42] const SORT_6 var_60 = 0; [L43] const SORT_1 var_73 = 1; [L44] const SORT_14 var_77 = 0; [L45] const SORT_10 var_107 = 0; [L46] const SORT_10 var_116 = 2; [L47] const SORT_10 var_119 = 4; [L48] const SORT_10 var_126 = 1; [L49] const SORT_121 var_133 = 1; [L50] const SORT_121 var_136 = 3; [L51] const SORT_121 var_139 = 2; [L53] SORT_1 input_2; [L54] SORT_1 input_3; [L55] SORT_1 input_4; [L56] SORT_1 input_5; [L57] SORT_6 input_7; [L58] SORT_6 input_8; [L59] SORT_1 input_9; [L60] SORT_10 input_11; [L61] SORT_1 input_12; [L62] SORT_1 input_13; [L63] SORT_14 input_15; [L64] SORT_10 input_16; [L65] SORT_1 input_17; [L66] SORT_6 input_18; [L67] SORT_1 input_19; [L68] SORT_10 input_20; [L69] SORT_10 input_21; [L70] SORT_6 input_22; [L71] SORT_6 input_23; [L72] SORT_1 input_24; [L73] SORT_14 input_25; [L74] SORT_10 input_26; [L75] SORT_1 input_27; [L76] SORT_6 input_28; [L77] SORT_6 input_29; [L78] SORT_6 input_30; [L79] SORT_6 input_31; [L80] SORT_10 input_32; [L81] SORT_10 input_33; [L82] SORT_10 input_34; [L83] SORT_10 input_35; [L84] SORT_10 input_36; [L85] SORT_10 input_37; [L86] SORT_10 input_38; [L87] SORT_10 input_39; [L88] SORT_1 input_40; [L89] SORT_1 input_41; [L90] SORT_1 input_42; [L91] SORT_1 input_43; [L92] SORT_1 input_44; [L93] SORT_1 input_45; [L94] SORT_14 input_46; [L95] SORT_14 input_47; [L96] SORT_14 input_48; [L97] SORT_14 input_49; [L98] SORT_6 input_50; [L99] SORT_6 input_51; [L100] SORT_1 input_52; [L101] SORT_1 input_53; [L102] SORT_1 input_54; [L103] SORT_1 input_55; [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L105] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L106] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L106] SORT_6 state_61 = __VERIFIER_nondet_uint() & mask_SORT_6; [L107] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L107] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L108] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L108] SORT_6 state_66 = __VERIFIER_nondet_uint() & mask_SORT_6; [L109] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L109] SORT_14 state_78 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L110] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L110] SORT_14 state_81 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L111] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L111] SORT_1 state_84 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L112] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L112] SORT_6 state_90 = __VERIFIER_nondet_uint() & mask_SORT_6; [L113] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L113] SORT_6 state_96 = __VERIFIER_nondet_uint() & mask_SORT_6; [L114] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L114] SORT_10 state_108 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L115] SORT_10 state_111 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L116] SORT_1 state_145 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L117] SORT_1 state_148 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L118] SORT_10 state_153 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L119] SORT_10 state_156 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L120] SORT_1 state_171 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L121] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L121] SORT_1 state_174 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L122] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L122] SORT_14 state_213 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L123] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L123] SORT_14 state_216 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L124] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L124] SORT_1 state_219 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L125] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L125] SORT_10 state_222 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L126] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L126] SORT_1 state_227 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L127] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L127] SORT_6 state_234 = __VERIFIER_nondet_uint() & mask_SORT_6; [L128] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L128] SORT_1 state_237 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L129] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L129] SORT_10 state_242 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L130] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L130] SORT_6 state_263 = __VERIFIER_nondet_uint() & mask_SORT_6; [L131] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L131] SORT_10 state_274 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L132] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L132] SORT_1 state_302 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L133] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L133] SORT_10 state_307 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L134] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L134] SORT_1 state_323 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L136] SORT_1 init_58_arg_1 = var_56; [L137] state_57 = init_58_arg_1 [L138] SORT_6 init_62_arg_1 = var_60; [L139] state_61 = init_62_arg_1 [L140] SORT_1 init_64_arg_1 = var_56; [L141] state_63 = init_64_arg_1 [L142] SORT_6 init_67_arg_1 = var_60; [L143] state_66 = init_67_arg_1 [L144] SORT_14 init_79_arg_1 = var_77; [L145] state_78 = init_79_arg_1 [L146] SORT_14 init_82_arg_1 = var_77; [L147] state_81 = init_82_arg_1 [L148] SORT_1 init_85_arg_1 = var_56; [L149] state_84 = init_85_arg_1 [L150] SORT_6 init_91_arg_1 = var_60; [L151] state_90 = init_91_arg_1 [L152] SORT_6 init_97_arg_1 = var_60; [L153] state_96 = init_97_arg_1 [L154] SORT_10 init_109_arg_1 = var_107; [L155] state_108 = init_109_arg_1 [L156] SORT_10 init_112_arg_1 = var_107; [L157] state_111 = init_112_arg_1 [L158] SORT_1 init_146_arg_1 = var_56; [L159] state_145 = init_146_arg_1 [L160] SORT_1 init_149_arg_1 = var_56; [L161] state_148 = init_149_arg_1 [L162] SORT_10 init_154_arg_1 = var_107; [L163] state_153 = init_154_arg_1 [L164] SORT_10 init_157_arg_1 = var_107; [L165] state_156 = init_157_arg_1 [L166] SORT_1 init_172_arg_1 = var_56; [L167] state_171 = init_172_arg_1 [L168] SORT_1 init_175_arg_1 = var_56; [L169] state_174 = init_175_arg_1 [L170] SORT_14 init_214_arg_1 = var_77; [L171] state_213 = init_214_arg_1 [L172] SORT_14 init_217_arg_1 = var_77; [L173] state_216 = init_217_arg_1 [L174] SORT_1 init_220_arg_1 = var_56; [L175] state_219 = init_220_arg_1 [L176] SORT_10 init_223_arg_1 = var_107; [L177] state_222 = init_223_arg_1 [L178] SORT_1 init_228_arg_1 = var_56; [L179] state_227 = init_228_arg_1 [L180] SORT_6 init_235_arg_1 = var_60; [L181] state_234 = init_235_arg_1 [L182] SORT_1 init_238_arg_1 = var_56; [L183] state_237 = init_238_arg_1 [L184] SORT_10 init_243_arg_1 = var_107; [L185] state_242 = init_243_arg_1 [L186] SORT_6 init_264_arg_1 = var_60; [L187] state_263 = init_264_arg_1 [L188] SORT_10 init_275_arg_1 = var_107; [L189] state_274 = init_275_arg_1 [L190] SORT_1 init_303_arg_1 = var_56; [L191] state_302 = init_303_arg_1 [L192] SORT_10 init_308_arg_1 = var_107; [L193] state_307 = init_308_arg_1 [L194] SORT_1 init_324_arg_1 = var_56; [L195] state_323 = init_324_arg_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L198] input_2 = __VERIFIER_nondet_uchar() [L199] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L199] input_2 = input_2 & mask_SORT_1 [L200] input_3 = __VERIFIER_nondet_uchar() [L201] input_4 = __VERIFIER_nondet_uchar() [L202] input_5 = __VERIFIER_nondet_uchar() [L203] input_7 = __VERIFIER_nondet_uint() [L204] input_8 = __VERIFIER_nondet_uint() [L205] input_9 = __VERIFIER_nondet_uchar() [L206] EXPR input_9 & mask_SORT_1 VAL [input_2=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L206] input_9 = input_9 & mask_SORT_1 [L207] input_11 = __VERIFIER_nondet_uchar() [L208] input_12 = __VERIFIER_nondet_uchar() [L209] input_13 = __VERIFIER_nondet_uchar() [L210] input_15 = __VERIFIER_nondet_ulong() [L211] input_16 = __VERIFIER_nondet_uchar() [L212] input_17 = __VERIFIER_nondet_uchar() [L213] input_18 = __VERIFIER_nondet_uint() [L214] input_19 = __VERIFIER_nondet_uchar() [L215] input_20 = __VERIFIER_nondet_uchar() [L216] input_21 = __VERIFIER_nondet_uchar() [L217] input_22 = __VERIFIER_nondet_uint() [L218] input_23 = __VERIFIER_nondet_uint() [L219] input_24 = __VERIFIER_nondet_uchar() [L220] input_25 = __VERIFIER_nondet_ulong() [L221] input_26 = __VERIFIER_nondet_uchar() [L222] input_27 = __VERIFIER_nondet_uchar() [L223] input_28 = __VERIFIER_nondet_uint() [L224] input_29 = __VERIFIER_nondet_uint() [L225] input_30 = __VERIFIER_nondet_uint() [L226] input_31 = __VERIFIER_nondet_uint() [L227] input_32 = __VERIFIER_nondet_uchar() [L228] input_33 = __VERIFIER_nondet_uchar() [L229] input_34 = __VERIFIER_nondet_uchar() [L230] input_35 = __VERIFIER_nondet_uchar() [L231] input_36 = __VERIFIER_nondet_uchar() [L232] input_37 = __VERIFIER_nondet_uchar() [L233] input_38 = __VERIFIER_nondet_uchar() [L234] input_39 = __VERIFIER_nondet_uchar() [L235] input_40 = __VERIFIER_nondet_uchar() [L236] input_41 = __VERIFIER_nondet_uchar() [L237] input_42 = __VERIFIER_nondet_uchar() [L238] input_43 = __VERIFIER_nondet_uchar() [L239] input_44 = __VERIFIER_nondet_uchar() [L240] input_45 = __VERIFIER_nondet_uchar() [L241] input_46 = __VERIFIER_nondet_ulong() [L242] input_47 = __VERIFIER_nondet_ulong() [L243] input_48 = __VERIFIER_nondet_ulong() [L244] input_49 = __VERIFIER_nondet_ulong() [L245] input_50 = __VERIFIER_nondet_uint() [L246] input_51 = __VERIFIER_nondet_uint() [L247] input_52 = __VERIFIER_nondet_uchar() [L248] input_53 = __VERIFIER_nondet_uchar() [L249] input_54 = __VERIFIER_nondet_uchar() [L250] input_55 = __VERIFIER_nondet_uchar() [L253] SORT_1 var_59_arg_0 = state_57; [L254] SORT_1 var_59 = ~var_59_arg_0; [L255] SORT_1 var_65_arg_0 = state_63; [L256] SORT_6 var_65_arg_1 = state_61; [L257] SORT_6 var_65_arg_2 = input_18; [L258] SORT_6 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; VAL [input_18=0, input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_59=-1, var_60=0, var_65=0, var_73=1, var_77=0] [L259] EXPR var_65 & mask_SORT_6 VAL [input_18=0, input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_59=-1, var_60=0, var_73=1, var_77=0] [L259] var_65 = var_65 & mask_SORT_6 [L260] SORT_1 var_68_arg_0 = state_63; [L261] SORT_6 var_68_arg_1 = state_66; [L262] SORT_6 var_68_arg_2 = input_18; [L263] SORT_6 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_59=-1, var_60=0, var_65=0, var_68=0, var_73=1, var_77=0] [L264] EXPR var_68 & mask_SORT_6 VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_59=-1, var_60=0, var_65=0, var_73=1, var_77=0] [L264] var_68 = var_68 & mask_SORT_6 [L265] SORT_6 var_69_arg_0 = var_65; [L266] SORT_6 var_69_arg_1 = var_68; [L267] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L268] SORT_1 var_70_arg_0 = var_59; [L269] SORT_1 var_70_arg_1 = var_69; VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_70_arg_0=-1, var_70_arg_1=1, var_73=1, var_77=0] [L270] EXPR var_70_arg_0 | var_70_arg_1 VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0] [L270] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L271] SORT_1 var_74_arg_0 = var_70; [L272] SORT_1 var_74 = ~var_74_arg_0; [L273] SORT_1 var_75_arg_0 = var_73; [L274] SORT_1 var_75_arg_1 = var_74; VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_73=1, var_75_arg_0=1, var_75_arg_1=-1, var_77=0] [L275] EXPR var_75_arg_0 & var_75_arg_1 VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0] [L275] SORT_1 var_75 = var_75_arg_0 & var_75_arg_1; [L276] EXPR var_75 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0] [L276] var_75 = var_75 & mask_SORT_1 [L277] SORT_1 bad_76_arg_0 = var_75; [L278] CALL __VERIFIER_assert(!(bad_76_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 513 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2406 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2406 mSDsluCounter, 14481 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11319 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3089 IncrementalHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 3162 mSDtfsCounter, 3089 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=537occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 54 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 495 NumberOfCodeBlocks, 495 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 1266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 01:39:27,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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.cal2.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 e845250638bf2269b9610642a85a2d027126b83f570f70da1feb220fdec8c1ec --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:39:29,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:39:29,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 01:39:29,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:39:29,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:39:30,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:39:30,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:39:30,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:39:30,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:39:30,015 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:39:30,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:39:30,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:39:30,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:39:30,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:39:30,019 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:39:30,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:39:30,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:39:30,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:39:30,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:39:30,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:39:30,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:39:30,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 01:39:30,025 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 01:39:30,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:39:30,025 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 01:39:30,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:39:30,025 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:39:30,026 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:39:30,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:39:30,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:39:30,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:39:30,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:39:30,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:39:30,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:39:30,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:39:30,027 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 01:39:30,028 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 01:39:30,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:39:30,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:39:30,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:39:30,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:39:30,030 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 -> e845250638bf2269b9610642a85a2d027126b83f570f70da1feb220fdec8c1ec [2024-11-10 01:39:30,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:39:30,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:39:30,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:39:30,401 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:39:30,402 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:39:30,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.c [2024-11-10 01:39:32,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:39:32,347 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:39:32,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.c [2024-11-10 01:39:32,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf11dcd2/349465f5171940df9271c3b5dad7eb3a/FLAG3900548a1 [2024-11-10 01:39:32,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf11dcd2/349465f5171940df9271c3b5dad7eb3a [2024-11-10 01:39:32,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:39:32,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:39:32,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:39:32,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:39:32,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:39:32,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:39:32" (1/1) ... [2024-11-10 01:39:32,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7045b668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:32, skipping insertion in model container [2024-11-10 01:39:32,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:39:32" (1/1) ... [2024-11-10 01:39:32,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:39:32,948 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.cal2.c[1244,1257] [2024-11-10 01:39:33,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:39:33,220 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:39:33,232 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.cal2.c[1244,1257] [2024-11-10 01:39:33,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:39:33,402 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:39:33,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:33 WrapperNode [2024-11-10 01:39:33,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:39:33,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:39:33,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:39:33,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:39:33,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:33" (1/1) ... [2024-11-10 01:39:33,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:33" (1/1) ... [2024-11-10 01:39:33,537 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1327 [2024-11-10 01:39:33,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:39:33,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:39:33,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:39:33,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:39:33,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:33" (1/1) ... [2024-11-10 01:39:33,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:33" (1/1) ... [2024-11-10 01:39:33,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:33" (1/1) ... [2024-11-10 01:39:33,625 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-10 01:39:33,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:33" (1/1) ... [2024-11-10 01:39:33,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:33" (1/1) ... [2024-11-10 01:39:33,659 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:33" (1/1) ... [2024-11-10 01:39:33,662 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:33" (1/1) ... [2024-11-10 01:39:33,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:33" (1/1) ... [2024-11-10 01:39:33,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:33" (1/1) ... [2024-11-10 01:39:33,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:39:33,684 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:39:33,684 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:39:33,684 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:39:33,685 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:33" (1/1) ... [2024-11-10 01:39:33,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:39:33,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:39:33,733 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 01:39:33,737 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 01:39:33,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:39:33,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 01:39:33,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 01:39:33,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:39:33,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:39:34,039 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:39:34,042 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:39:35,173 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-11-10 01:39:35,174 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:39:35,185 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:39:35,187 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:39:35,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:39:35 BoogieIcfgContainer [2024-11-10 01:39:35,188 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:39:35,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:39:35,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:39:35,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:39:35,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:39:32" (1/3) ... [2024-11-10 01:39:35,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149fd740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:39:35, skipping insertion in model container [2024-11-10 01:39:35,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:33" (2/3) ... [2024-11-10 01:39:35,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149fd740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:39:35, skipping insertion in model container [2024-11-10 01:39:35,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:39:35" (3/3) ... [2024-11-10 01:39:35,196 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal2.c [2024-11-10 01:39:35,213 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:39:35,213 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:39:35,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:39:35,293 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;@eb2f9df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:39:35,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:39:35,299 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 01:39:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 01:39:35,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:39:35,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 01:39:35,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:39:35,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:39:35,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 01:39:35,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 01:39:35,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097135420] [2024-11-10 01:39:35,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:39:35,327 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 01:39:35,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 01:39:35,329 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 01:39:35,345 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 01:39:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:39:35,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 01:39:35,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:39:35,860 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 01:39:35,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 01:39:35,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 01:39:35,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097135420] [2024-11-10 01:39:35,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097135420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:39:35,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:39:35,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:39:35,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291351590] [2024-11-10 01:39:35,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:39:35,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:39:35,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 01:39:35,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:39:35,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:39:35,908 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 01:39:36,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:39:36,095 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-10 01:39:36,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:39:36,097 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 01:39:36,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:39:36,104 INFO L225 Difference]: With dead ends: 22 [2024-11-10 01:39:36,104 INFO L226 Difference]: Without dead ends: 11 [2024-11-10 01:39:36,107 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 01:39:36,112 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.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:39:36,114 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.2s Time] [2024-11-10 01:39:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-10 01:39:36,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-10 01:39:36,141 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 01:39:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 01:39:36,144 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 01:39:36,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:39:36,145 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 01:39:36,145 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 01:39:36,145 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 01:39:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 01:39:36,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:39:36,147 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:39:36,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 01:39:36,351 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 01:39:36,352 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:39:36,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:39:36,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 01:39:36,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 01:39:36,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295744292] [2024-11-10 01:39:36,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:39:36,354 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 01:39:36,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 01:39:36,357 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 01:39:36,358 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 01:39:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:39:36,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 01:39:36,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:39:36,993 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 01:39:36,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 01:39:37,718 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 01:39:37,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 01:39:37,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295744292] [2024-11-10 01:39:37,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295744292] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 01:39:37,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 01:39:37,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 01:39:37,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32361022] [2024-11-10 01:39:37,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 01:39:37,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:39:37,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 01:39:37,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:39:37,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:39:37,728 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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 01:39:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:39:38,050 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-10 01:39:38,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:39:38,050 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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 01:39:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:39:38,051 INFO L225 Difference]: With dead ends: 17 [2024-11-10 01:39:38,051 INFO L226 Difference]: Without dead ends: 14 [2024-11-10 01:39:38,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-10 01:39:38,053 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:39:38,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 18 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:39:38,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-10 01:39:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-10 01:39:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:39:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-10 01:39:38,057 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2024-11-10 01:39:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:39:38,057 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-10 01:39:38,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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 01:39:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-10 01:39:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 01:39:38,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:39:38,058 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-10 01:39:38,069 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 01:39:38,258 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 01:39:38,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:39:38,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:39:38,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1723041149, now seen corresponding path program 2 times [2024-11-10 01:39:38,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 01:39:38,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883920458] [2024-11-10 01:39:38,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 01:39:38,261 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 01:39:38,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 01:39:38,264 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 01:39:38,265 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 01:39:39,512 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 01:39:39,512 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 01:39:39,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 01:39:39,552 INFO L278 TraceCheckSpWp]: Computing forward predicates...