./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p05.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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.vis_arrays_vsaR_p05.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 0566765eaff6c3202082c0158f35b834bab7b3ce60f20a1eebf1eb36cc13f11e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 11:58:45,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 11:58:45,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 11:58:45,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 11:58:45,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 11:58:45,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 11:58:45,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 11:58:45,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 11:58:45,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 11:58:45,846 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 11:58:45,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 11:58:45,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 11:58:45,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 11:58:45,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 11:58:45,851 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 11:58:45,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 11:58:45,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 11:58:45,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 11:58:45,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 11:58:45,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 11:58:45,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 11:58:45,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 11:58:45,857 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 11:58:45,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 11:58:45,857 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 11:58:45,857 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 11:58:45,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 11:58:45,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 11:58:45,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 11:58:45,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:58:45,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 11:58:45,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 11:58:45,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 11:58:45,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 11:58:45,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 11:58:45,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 11:58:45,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 11:58:45,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 11:58:45,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 11:58:45,862 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 -> 0566765eaff6c3202082c0158f35b834bab7b3ce60f20a1eebf1eb36cc13f11e [2024-11-16 11:58:46,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 11:58:46,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 11:58:46,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 11:58:46,188 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 11:58:46,189 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 11:58:46,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p05.c [2024-11-16 11:58:47,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 11:58:47,976 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 11:58:47,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p05.c [2024-11-16 11:58:47,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/482636490/d83ca9d897214ca297cbdcbc5414c3d6/FLAG8b46b092a [2024-11-16 11:58:48,007 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/482636490/d83ca9d897214ca297cbdcbc5414c3d6 [2024-11-16 11:58:48,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 11:58:48,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 11:58:48,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 11:58:48,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 11:58:48,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 11:58:48,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:58:48" (1/1) ... [2024-11-16 11:58:48,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c9da0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:48, skipping insertion in model container [2024-11-16 11:58:48,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:58:48" (1/1) ... [2024-11-16 11:58:48,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 11:58:48,332 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.vis_arrays_vsaR_p05.c[1259,1272] [2024-11-16 11:58:48,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:58:48,636 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 11:58:48,647 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.vis_arrays_vsaR_p05.c[1259,1272] [2024-11-16 11:58:48,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:58:48,797 INFO L204 MainTranslator]: Completed translation [2024-11-16 11:58:48,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:48 WrapperNode [2024-11-16 11:58:48,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 11:58:48,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 11:58:48,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 11:58:48,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 11:58:48,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:48" (1/1) ... [2024-11-16 11:58:48,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:48" (1/1) ... [2024-11-16 11:58:49,139 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2155 [2024-11-16 11:58:49,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 11:58:49,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 11:58:49,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 11:58:49,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 11:58:49,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:48" (1/1) ... [2024-11-16 11:58:49,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:48" (1/1) ... [2024-11-16 11:58:49,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:48" (1/1) ... [2024-11-16 11:58:49,270 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 11:58:49,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:48" (1/1) ... [2024-11-16 11:58:49,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:48" (1/1) ... [2024-11-16 11:58:49,353 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:48" (1/1) ... [2024-11-16 11:58:49,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:48" (1/1) ... [2024-11-16 11:58:49,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:48" (1/1) ... [2024-11-16 11:58:49,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:48" (1/1) ... [2024-11-16 11:58:49,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 11:58:49,584 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 11:58:49,584 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 11:58:49,584 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 11:58:49,585 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:48" (1/1) ... [2024-11-16 11:58:49,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:58:49,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:58:49,627 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-16 11:58:49,634 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-16 11:58:49,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 11:58:49,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 11:58:49,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 11:58:49,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 11:58:49,940 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 11:58:49,942 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 11:58:52,338 INFO L? ?]: Removed 1343 outVars from TransFormulas that were not future-live. [2024-11-16 11:58:52,338 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 11:58:52,479 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 11:58:52,484 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 11:58:52,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:58:52 BoogieIcfgContainer [2024-11-16 11:58:52,485 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 11:58:52,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 11:58:52,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 11:58:52,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 11:58:52,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:58:48" (1/3) ... [2024-11-16 11:58:52,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33956469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:58:52, skipping insertion in model container [2024-11-16 11:58:52,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:48" (2/3) ... [2024-11-16 11:58:52,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33956469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:58:52, skipping insertion in model container [2024-11-16 11:58:52,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:58:52" (3/3) ... [2024-11-16 11:58:52,499 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p05.c [2024-11-16 11:58:52,519 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 11:58:52,519 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 11:58:52,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 11:58:52,626 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;@7aff5161, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 11:58:52,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 11:58:52,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 550 states, 548 states have (on average 1.4963503649635037) internal successors, (820), 549 states have internal predecessors, (820), 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-16 11:58:52,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-16 11:58:52,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:58:52,647 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:58:52,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:58:52,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:58:52,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2094593850, now seen corresponding path program 1 times [2024-11-16 11:58:52,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:58:52,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010033711] [2024-11-16 11:58:52,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:58:52,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:58:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:58:53,481 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-16 11:58:53,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:58:53,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010033711] [2024-11-16 11:58:53,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010033711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:58:53,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:58:53,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:58:53,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697880487] [2024-11-16 11:58:53,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:58:53,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:58:53,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:58:53,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:58:53,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:58:53,525 INFO L87 Difference]: Start difference. First operand has 550 states, 548 states have (on average 1.4963503649635037) internal successors, (820), 549 states have internal predecessors, (820), 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 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-16 11:58:53,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:58:53,999 INFO L93 Difference]: Finished difference Result 1043 states and 1559 transitions. [2024-11-16 11:58:54,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:58:54,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2024-11-16 11:58:54,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:58:54,023 INFO L225 Difference]: With dead ends: 1043 [2024-11-16 11:58:54,023 INFO L226 Difference]: Without dead ends: 547 [2024-11-16 11:58:54,029 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-16 11:58:54,035 INFO L432 NwaCegarLoop]: 678 mSDtfsCounter, 0 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2029 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 11:58:54,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2029 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 11:58:54,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-16 11:58:54,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2024-11-16 11:58:54,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.4945054945054945) internal successors, (816), 546 states have internal predecessors, (816), 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-16 11:58:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 816 transitions. [2024-11-16 11:58:54,121 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 816 transitions. Word has length 46 [2024-11-16 11:58:54,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:58:54,121 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 816 transitions. [2024-11-16 11:58:54,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-16 11:58:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 816 transitions. [2024-11-16 11:58:54,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 11:58:54,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:58:54,125 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] [2024-11-16 11:58:54,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 11:58:54,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:58:54,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:58:54,126 INFO L85 PathProgramCache]: Analyzing trace with hash -362845733, now seen corresponding path program 1 times [2024-11-16 11:58:54,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:58:54,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798837333] [2024-11-16 11:58:54,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:58:54,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:58:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:58:54,411 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-16 11:58:54,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:58:54,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798837333] [2024-11-16 11:58:54,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798837333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:58:54,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:58:54,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:58:54,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623794925] [2024-11-16 11:58:54,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:58:54,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:58:54,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:58:54,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:58:54,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:58:54,416 INFO L87 Difference]: Start difference. First operand 547 states and 816 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-16 11:58:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:58:54,747 INFO L93 Difference]: Finished difference Result 1042 states and 1555 transitions. [2024-11-16 11:58:54,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:58:54,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2024-11-16 11:58:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:58:54,750 INFO L225 Difference]: With dead ends: 1042 [2024-11-16 11:58:54,751 INFO L226 Difference]: Without dead ends: 549 [2024-11-16 11:58:54,755 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-16 11:58:54,756 INFO L432 NwaCegarLoop]: 678 mSDtfsCounter, 0 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 11:58:54,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2026 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 11:58:54,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-16 11:58:54,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2024-11-16 11:58:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.4927007299270072) internal successors, (818), 548 states have internal predecessors, (818), 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-16 11:58:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 818 transitions. [2024-11-16 11:58:54,793 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 818 transitions. Word has length 47 [2024-11-16 11:58:54,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:58:54,794 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 818 transitions. [2024-11-16 11:58:54,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-16 11:58:54,795 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 818 transitions. [2024-11-16 11:58:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-16 11:58:54,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:58:54,797 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] [2024-11-16 11:58:54,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 11:58:54,798 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:58:54,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:58:54,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1383928523, now seen corresponding path program 1 times [2024-11-16 11:58:54,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:58:54,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508510306] [2024-11-16 11:58:54,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:58:54,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:58:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:58:55,617 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-16 11:58:55,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:58:55,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508510306] [2024-11-16 11:58:55,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508510306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:58:55,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:58:55,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 11:58:55,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802778576] [2024-11-16 11:58:55,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:58:55,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 11:58:55,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:58:55,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 11:58:55,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 11:58:55,622 INFO L87 Difference]: Start difference. First operand 549 states and 818 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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-16 11:58:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:58:56,299 INFO L93 Difference]: Finished difference Result 1048 states and 1562 transitions. [2024-11-16 11:58:56,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 11:58:56,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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 48 [2024-11-16 11:58:56,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:58:56,302 INFO L225 Difference]: With dead ends: 1048 [2024-11-16 11:58:56,303 INFO L226 Difference]: Without dead ends: 553 [2024-11-16 11:58:56,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 11:58:56,305 INFO L432 NwaCegarLoop]: 666 mSDtfsCounter, 785 mSDsluCounter, 3316 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 3982 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 11:58:56,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 3982 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 11:58:56,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-16 11:58:56,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 552. [2024-11-16 11:58:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 1.4900181488203266) internal successors, (821), 551 states have internal predecessors, (821), 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-16 11:58:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 821 transitions. [2024-11-16 11:58:56,328 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 821 transitions. Word has length 48 [2024-11-16 11:58:56,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:58:56,329 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 821 transitions. [2024-11-16 11:58:56,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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-16 11:58:56,329 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 821 transitions. [2024-11-16 11:58:56,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-16 11:58:56,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:58:56,331 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] [2024-11-16 11:58:56,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 11:58:56,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:58:56,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:58:56,332 INFO L85 PathProgramCache]: Analyzing trace with hash 563004019, now seen corresponding path program 1 times [2024-11-16 11:58:56,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:58:56,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010190376] [2024-11-16 11:58:56,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:58:56,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:58:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:58:56,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 11:58:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:58:56,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 11:58:56,532 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 11:58:56,533 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 11:58:56,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 11:58:56,538 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-16 11:58:56,621 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 11:58:56,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:58:56 BoogieIcfgContainer [2024-11-16 11:58:56,630 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 11:58:56,631 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 11:58:56,631 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 11:58:56,631 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 11:58:56,632 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:58:52" (3/4) ... [2024-11-16 11:58:56,634 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 11:58:56,636 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 11:58:56,637 INFO L158 Benchmark]: Toolchain (without parser) took 8625.53ms. Allocated memory was 123.7MB in the beginning and 415.2MB in the end (delta: 291.5MB). Free memory was 53.5MB in the beginning and 176.4MB in the end (delta: -122.9MB). Peak memory consumption was 171.2MB. Max. memory is 16.1GB. [2024-11-16 11:58:56,638 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 123.7MB. Free memory was 75.9MB in the beginning and 75.7MB in the end (delta: 158.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:58:56,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 784.45ms. Allocated memory was 123.7MB in the beginning and 165.7MB in the end (delta: 41.9MB). Free memory was 53.4MB in the beginning and 92.5MB in the end (delta: -39.1MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-11-16 11:58:56,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 340.26ms. Allocated memory is still 165.7MB. Free memory was 92.5MB in the beginning and 90.3MB in the end (delta: 2.2MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2024-11-16 11:58:56,640 INFO L158 Benchmark]: Boogie Preprocessor took 441.28ms. Allocated memory was 165.7MB in the beginning and 295.7MB in the end (delta: 130.0MB). Free memory was 90.3MB in the beginning and 226.7MB in the end (delta: -136.5MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2024-11-16 11:58:56,640 INFO L158 Benchmark]: IcfgBuilder took 2901.70ms. Allocated memory is still 295.7MB. Free memory was 226.7MB in the beginning and 217.3MB in the end (delta: 9.4MB). Peak memory consumption was 123.5MB. Max. memory is 16.1GB. [2024-11-16 11:58:56,641 INFO L158 Benchmark]: TraceAbstraction took 4143.14ms. Allocated memory was 295.7MB in the beginning and 415.2MB in the end (delta: 119.5MB). Free memory was 217.3MB in the beginning and 177.5MB in the end (delta: 39.8MB). Peak memory consumption was 158.5MB. Max. memory is 16.1GB. [2024-11-16 11:58:56,641 INFO L158 Benchmark]: Witness Printer took 5.52ms. Allocated memory is still 415.2MB. Free memory is still 176.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:58:56,643 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.85ms. Allocated memory is still 123.7MB. Free memory was 75.9MB in the beginning and 75.7MB in the end (delta: 158.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 784.45ms. Allocated memory was 123.7MB in the beginning and 165.7MB in the end (delta: 41.9MB). Free memory was 53.4MB in the beginning and 92.5MB in the end (delta: -39.1MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 340.26ms. Allocated memory is still 165.7MB. Free memory was 92.5MB in the beginning and 90.3MB in the end (delta: 2.2MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 441.28ms. Allocated memory was 165.7MB in the beginning and 295.7MB in the end (delta: 130.0MB). Free memory was 90.3MB in the beginning and 226.7MB in the end (delta: -136.5MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. * IcfgBuilder took 2901.70ms. Allocated memory is still 295.7MB. Free memory was 226.7MB in the beginning and 217.3MB in the end (delta: 9.4MB). Peak memory consumption was 123.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4143.14ms. Allocated memory was 295.7MB in the beginning and 415.2MB in the end (delta: 119.5MB). Free memory was 217.3MB in the beginning and 177.5MB in the end (delta: 39.8MB). Peak memory consumption was 158.5MB. Max. memory is 16.1GB. * Witness Printer took 5.52ms. Allocated memory is still 415.2MB. Free memory is still 176.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 bitwiseAnd at line 175. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 2); [L36] const SORT_10 msb_SORT_10 = (SORT_10)1 << (2 - 1); [L38] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 3); [L39] const SORT_14 msb_SORT_14 = (SORT_14)1 << (3 - 1); [L41] const SORT_96 mask_SORT_96 = (SORT_96)-1 >> (sizeof(SORT_96) * 8 - 4); [L42] const SORT_96 msb_SORT_96 = (SORT_96)1 << (4 - 1); [L44] const SORT_145 mask_SORT_145 = (SORT_145)-1 >> (sizeof(SORT_145) * 8 - 32); [L45] const SORT_145 msb_SORT_145 = (SORT_145)1 << (32 - 1); [L47] const SORT_5 var_7 = 0; [L48] const SORT_14 var_15 = 0; [L49] const SORT_10 var_19 = 0; [L50] const SORT_3 var_21 = 0; [L51] const SORT_1 var_31 = 1; [L52] const SORT_1 var_37 = 0; [L53] const SORT_14 var_55 = 2; [L54] const SORT_14 var_59 = 1; [L55] const SORT_14 var_64 = 4; [L56] const SORT_14 var_66 = 5; [L57] const SORT_14 var_70 = 3; [L58] const SORT_14 var_113 = 7; [L59] const SORT_14 var_118 = 6; [L60] const SORT_145 var_147 = 0; [L61] const SORT_3 var_162 = 2; [L62] const SORT_3 var_184 = 31; [L64] SORT_1 input_2; [L65] SORT_3 input_4; [L66] SORT_5 input_6; [L67] SORT_3 input_173; [L68] SORT_3 input_174; [L69] SORT_3 input_175; [L70] SORT_3 input_183; [L71] SORT_3 input_192; [L72] SORT_3 input_193; [L73] SORT_3 input_194; [L74] SORT_3 input_197; [L75] SORT_3 input_216; [L76] SORT_3 input_217; [L77] SORT_3 input_218; [L78] SORT_3 input_221; [L79] SORT_3 input_223; [L80] SORT_10 input_237; [L81] SORT_10 input_238; [L82] SORT_10 input_239; [L84] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L84] SORT_5 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_14 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L85] SORT_14 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_14; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L86] SORT_3 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L87] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L88] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L89] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L90] SORT_3 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L91] SORT_3 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L92] SORT_3 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L93] SORT_3 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L94] SORT_3 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L95] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L96] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L98] SORT_5 init_9_arg_1 = var_7; [L99] state_8 = init_9_arg_1 [L100] SORT_14 init_17_arg_1 = var_15; [L101] state_16 = init_17_arg_1 [L102] SORT_3 init_23_arg_1 = var_21; [L103] state_22 = init_23_arg_1 [L104] SORT_3 init_25_arg_1 = var_21; [L105] state_24 = init_25_arg_1 [L106] SORT_3 init_36_arg_1 = var_21; [L107] state_35 = init_36_arg_1 [L108] SORT_1 init_39_arg_1 = var_37; [L109] state_38 = init_39_arg_1 [L110] SORT_3 init_41_arg_1 = var_21; [L111] state_40 = init_41_arg_1 [L112] SORT_3 init_43_arg_1 = var_21; [L113] state_42 = init_43_arg_1 [L114] SORT_3 init_45_arg_1 = var_21; [L115] state_44 = init_45_arg_1 [L116] SORT_3 init_47_arg_1 = var_21; [L117] state_46 = init_47_arg_1 [L118] SORT_3 init_49_arg_1 = var_21; [L119] state_48 = init_49_arg_1 [L120] SORT_3 init_51_arg_1 = var_21; [L121] state_50 = init_51_arg_1 [L122] SORT_3 init_53_arg_1 = var_21; [L123] state_52 = init_53_arg_1 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L126] input_2 = __VERIFIER_nondet_uchar() [L127] input_4 = __VERIFIER_nondet_uchar() [L128] input_6 = __VERIFIER_nondet_ushort() [L129] input_173 = __VERIFIER_nondet_uchar() [L130] input_174 = __VERIFIER_nondet_uchar() [L131] input_175 = __VERIFIER_nondet_uchar() [L132] input_183 = __VERIFIER_nondet_uchar() [L133] input_192 = __VERIFIER_nondet_uchar() [L134] input_193 = __VERIFIER_nondet_uchar() [L135] input_194 = __VERIFIER_nondet_uchar() [L136] input_197 = __VERIFIER_nondet_uchar() [L137] input_216 = __VERIFIER_nondet_uchar() [L138] input_217 = __VERIFIER_nondet_uchar() [L139] input_218 = __VERIFIER_nondet_uchar() [L140] input_221 = __VERIFIER_nondet_uchar() [L141] input_223 = __VERIFIER_nondet_uchar() [L142] input_237 = __VERIFIER_nondet_uchar() [L143] input_238 = __VERIFIER_nondet_uchar() [L144] input_239 = __VERIFIER_nondet_uchar() [L147] SORT_5 var_11_arg_0 = state_8; [L148] SORT_10 var_11 = var_11_arg_0 >> 7; VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_11=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L149] EXPR var_11 & mask_SORT_10 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L149] var_11 = var_11 & mask_SORT_10 [L150] SORT_5 var_12_arg_0 = state_8; [L151] SORT_10 var_12 = var_12_arg_0 >> 5; VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_11=0, var_12=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L152] EXPR var_12 & mask_SORT_10 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_11=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L152] var_12 = var_12 & mask_SORT_10 [L153] SORT_10 var_13_arg_0 = var_11; [L154] SORT_10 var_13_arg_1 = var_12; [L155] SORT_1 var_13 = var_13_arg_0 != var_13_arg_1; [L156] SORT_14 var_18_arg_0 = state_16; [L157] SORT_10 var_18 = var_18_arg_0 >> 1; VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_13=0, var_147=0, var_15=0, var_162=2, var_184=31, var_18=0, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L158] EXPR var_18 & mask_SORT_10 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_13=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L158] var_18 = var_18 & mask_SORT_10 [L159] SORT_10 var_20_arg_0 = var_18; [L160] SORT_10 var_20_arg_1 = var_19; [L161] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L162] SORT_3 var_26_arg_0 = state_22; [L163] SORT_3 var_26_arg_1 = state_24; [L164] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L165] SORT_1 var_27_arg_0 = var_20; [L166] SORT_1 var_27_arg_1 = var_26; VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_13=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_27_arg_0=1, var_27_arg_1=1, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L167] EXPR var_27_arg_0 | var_27_arg_1 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_13=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L167] SORT_1 var_27 = var_27_arg_0 | var_27_arg_1; [L168] SORT_1 var_28_arg_0 = var_13; [L169] SORT_1 var_28_arg_1 = var_27; VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_28_arg_0=0, var_28_arg_1=1, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L170] EXPR var_28_arg_0 | var_28_arg_1 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L170] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L171] SORT_1 var_32_arg_0 = var_28; [L172] SORT_1 var_32 = ~var_32_arg_0; [L173] SORT_1 var_33_arg_0 = var_31; [L174] SORT_1 var_33_arg_1 = var_32; VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_33_arg_0=1, var_33_arg_1=-2, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L175] EXPR var_33_arg_0 & var_33_arg_1 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L175] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L176] EXPR var_33 & mask_SORT_1 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L176] var_33 = var_33 & mask_SORT_1 [L177] SORT_1 bad_34_arg_0 = var_33; [L178] CALL __VERIFIER_assert(!(bad_34_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 550 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 785 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 785 mSDsluCounter, 8037 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6015 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1716 IncrementalHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 2022 mSDtfsCounter, 1716 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=552occurred in iteration=3, InterpolantAutomatonStates: 16, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 282 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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-16 11:58:56,687 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.vis_arrays_vsaR_p05.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 0566765eaff6c3202082c0158f35b834bab7b3ce60f20a1eebf1eb36cc13f11e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 11:58:59,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 11:58:59,160 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-16 11:58:59,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 11:58:59,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 11:58:59,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 11:58:59,198 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 11:58:59,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 11:58:59,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 11:58:59,201 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 11:58:59,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 11:58:59,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 11:58:59,202 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 11:58:59,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 11:58:59,205 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 11:58:59,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 11:58:59,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 11:58:59,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 11:58:59,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 11:58:59,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 11:58:59,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 11:58:59,207 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 11:58:59,207 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 11:58:59,207 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 11:58:59,208 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 11:58:59,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 11:58:59,208 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 11:58:59,208 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 11:58:59,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 11:58:59,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 11:58:59,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 11:58:59,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:58:59,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 11:58:59,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 11:58:59,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 11:58:59,216 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 11:58:59,216 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 11:58:59,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 11:58:59,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 11:58:59,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 11:58:59,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 11:58:59,218 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 -> 0566765eaff6c3202082c0158f35b834bab7b3ce60f20a1eebf1eb36cc13f11e [2024-11-16 11:58:59,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 11:58:59,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 11:58:59,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 11:58:59,558 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 11:58:59,558 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 11:58:59,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p05.c [2024-11-16 11:59:01,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 11:59:01,429 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 11:59:01,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p05.c [2024-11-16 11:59:01,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5313ce1c/f9718e6aadb34bb5878ab4b72169f36e/FLAGcf6a5ab64 [2024-11-16 11:59:01,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5313ce1c/f9718e6aadb34bb5878ab4b72169f36e [2024-11-16 11:59:01,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 11:59:01,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 11:59:01,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 11:59:01,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 11:59:01,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 11:59:01,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:59:01" (1/1) ... [2024-11-16 11:59:01,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2052e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:01, skipping insertion in model container [2024-11-16 11:59:01,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:59:01" (1/1) ... [2024-11-16 11:59:01,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 11:59:02,075 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.vis_arrays_vsaR_p05.c[1259,1272] [2024-11-16 11:59:02,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:59:02,399 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 11:59:02,410 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.vis_arrays_vsaR_p05.c[1259,1272] [2024-11-16 11:59:02,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:59:02,566 INFO L204 MainTranslator]: Completed translation [2024-11-16 11:59:02,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:02 WrapperNode [2024-11-16 11:59:02,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 11:59:02,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 11:59:02,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 11:59:02,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 11:59:02,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:02" (1/1) ... [2024-11-16 11:59:02,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:02" (1/1) ... [2024-11-16 11:59:02,719 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1081 [2024-11-16 11:59:02,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 11:59:02,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 11:59:02,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 11:59:02,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 11:59:02,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:02" (1/1) ... [2024-11-16 11:59:02,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:02" (1/1) ... [2024-11-16 11:59:02,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:02" (1/1) ... [2024-11-16 11:59:02,807 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 11:59:02,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:02" (1/1) ... [2024-11-16 11:59:02,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:02" (1/1) ... [2024-11-16 11:59:02,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:02" (1/1) ... [2024-11-16 11:59:02,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:02" (1/1) ... [2024-11-16 11:59:02,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:02" (1/1) ... [2024-11-16 11:59:02,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:02" (1/1) ... [2024-11-16 11:59:02,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 11:59:02,865 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 11:59:02,865 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 11:59:02,865 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 11:59:02,870 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:02" (1/1) ... [2024-11-16 11:59:02,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:59:02,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:59:02,909 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-16 11:59:02,913 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-16 11:59:02,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 11:59:02,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 11:59:02,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 11:59:02,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 11:59:03,272 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 11:59:03,274 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 11:59:04,722 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-11-16 11:59:04,722 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 11:59:04,736 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 11:59:04,737 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 11:59:04,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:59:04 BoogieIcfgContainer [2024-11-16 11:59:04,739 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 11:59:04,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 11:59:04,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 11:59:04,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 11:59:04,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:59:01" (1/3) ... [2024-11-16 11:59:04,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53067c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:59:04, skipping insertion in model container [2024-11-16 11:59:04,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:02" (2/3) ... [2024-11-16 11:59:04,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53067c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:59:04, skipping insertion in model container [2024-11-16 11:59:04,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:59:04" (3/3) ... [2024-11-16 11:59:04,749 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p05.c [2024-11-16 11:59:04,768 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 11:59:04,769 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 11:59:04,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 11:59:04,845 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;@33d5cfa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 11:59:04,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 11:59:04,855 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-16 11:59:04,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-16 11:59:04,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:04,866 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-16 11:59:04,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:04,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:04,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-16 11:59:04,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:59:04,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490419970] [2024-11-16 11:59:04,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:04,892 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-16 11:59:04,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:59:04,896 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-16 11:59:04,898 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-16 11:59:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:59:05,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-16 11:59:05,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:59:05,436 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-16 11:59:05,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 11:59:05,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 11:59:05,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490419970] [2024-11-16 11:59:05,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490419970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:59:05,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:59:05,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:59:05,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163130381] [2024-11-16 11:59:05,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:59:05,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:59:05,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 11:59:05,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:59:05,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:59:05,486 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-16 11:59:05,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:59:05,582 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-16 11:59:05,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:59:05,586 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-16 11:59:05,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:59:05,594 INFO L225 Difference]: With dead ends: 22 [2024-11-16 11:59:05,594 INFO L226 Difference]: Without dead ends: 11 [2024-11-16 11:59:05,597 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-16 11:59:05,604 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:59:05,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:59:05,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-16 11:59:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-16 11:59:05,639 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-16 11:59:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-16 11:59:05,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-16 11:59:05,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:59:05,642 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-16 11:59:05,642 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-16 11:59:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-16 11:59:05,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 11:59:05,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:05,643 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:59:05,648 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-16 11:59:05,844 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-16 11:59:05,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:05,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:05,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-16 11:59:05,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:59:05,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071966763] [2024-11-16 11:59:05,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:05,847 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-16 11:59:05,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:59:05,851 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-16 11:59:05,852 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-16 11:59:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:59:06,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-16 11:59:06,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:59:06,608 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-16 11:59:06,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:59:12,092 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_16~0#1|))) (let ((.cse0 (= .cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_64~0#1|)))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_15~0#1|)))) (.cse4 (not .cse0)) (.cse1 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_10~0#1|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_59~0#1|))))))) (.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_19~0#1|)) (.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (and (or (and (or .cse0 (forall ((|ULTIMATE.start_main_~mask_SORT_14~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_14~0#1|) .cse2))) (_ bv1 32))))))) .cse3))) (or .cse4 (forall ((|ULTIMATE.start_main_~mask_SORT_14~0#1| (_ BitVec 8))) (= .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_14~0#1|)))) (_ bv1 32))))))))))) (forall ((|v_ULTIMATE.start_main_~var_27_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_33_arg_0~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_28_arg_0~0#1_10| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_27_arg_1~0#1_10|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_28_arg_0~0#1_10|)))))))))))) (_ bv0 8)))) (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_14~0#1| (_ BitVec 8))) (not (= .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_14~0#1|)))) (_ bv1 32)))))))))) .cse4) (or .cse0 (forall ((|ULTIMATE.start_main_~mask_SORT_14~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_14~0#1|) .cse2))) (_ bv1 32))))))) .cse3))))) (forall ((|v_ULTIMATE.start_main_~var_27_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_33_arg_0~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_28_arg_0~0#1_10| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_28_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_27_arg_1~0#1_10|)))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_0~0#1_10|)))))) (_ bv0 8)))))))) is different from false [2024-11-16 11:59:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-16 11:59:12,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 11:59:12,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071966763] [2024-11-16 11:59:12,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071966763] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 11:59:12,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 11:59:12,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-16 11:59:12,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278605706] [2024-11-16 11:59:12,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 11:59:12,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 11:59:12,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 11:59:12,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 11:59:12,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-16 11:59:12,663 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-16 11:59:13,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:59:13,308 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-16 11:59:13,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 11:59:13,309 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-16 11:59:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:59:13,310 INFO L225 Difference]: With dead ends: 17 [2024-11-16 11:59:13,310 INFO L226 Difference]: Without dead ends: 14 [2024-11-16 11:59:13,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=31, Invalid=44, Unknown=1, NotChecked=14, Total=90 [2024-11-16 11:59:13,311 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:59:13,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 23 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 6 Unchecked, 0.2s Time] [2024-11-16 11:59:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-16 11:59:13,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-16 11:59:13,316 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-16 11:59:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-16 11:59:13,317 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2024-11-16 11:59:13,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:59:13,317 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-16 11:59:13,317 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-16 11:59:13,318 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-16 11:59:13,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 11:59:13,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:13,318 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-16 11:59:13,324 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-16 11:59:13,519 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-16 11:59:13,520 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:13,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:13,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1723041149, now seen corresponding path program 2 times [2024-11-16 11:59:13,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:59:13,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235640572] [2024-11-16 11:59:13,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 11:59:13,522 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-16 11:59:13,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:59:13,525 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-16 11:59:13,526 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-16 11:59:14,086 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 11:59:14,087 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 11:59:14,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-16 11:59:14,114 INFO L278 TraceCheckSpWp]: Computing forward predicates...