./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.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 3888704d5a955b45281a90f2156d0109c7e11fdda93c54cd78435365c9c632be --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 04:57:57,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 04:57:57,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 04:57:57,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 04:57:57,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 04:57:57,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 04:57:57,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 04:57:57,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 04:57:57,772 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 04:57:57,773 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 04:57:57,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 04:57:57,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 04:57:57,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 04:57:57,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 04:57:57,776 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 04:57:57,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 04:57:57,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 04:57:57,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 04:57:57,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 04:57:57,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 04:57:57,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 04:57:57,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 04:57:57,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 04:57:57,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 04:57:57,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 04:57:57,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 04:57:57,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 04:57:57,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 04:57:57,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 04:57:57,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:57:57,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 04:57:57,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 04:57:57,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 04:57:57,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 04:57:57,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 04:57:57,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 04:57:57,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 04:57:57,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 04:57:57,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 04:57:57,786 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 -> 3888704d5a955b45281a90f2156d0109c7e11fdda93c54cd78435365c9c632be [2024-10-24 04:57:58,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 04:57:58,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 04:57:58,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 04:57:58,066 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 04:57:58,066 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 04:57:58,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2024-10-24 04:57:59,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 04:57:59,736 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 04:57:59,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2024-10-24 04:57:59,747 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e1b0cf80/ee64de38e1a5441fbd9d36e7dc88e5ed/FLAG2ec518061 [2024-10-24 04:58:00,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e1b0cf80/ee64de38e1a5441fbd9d36e7dc88e5ed [2024-10-24 04:58:00,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 04:58:00,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 04:58:00,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 04:58:00,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 04:58:00,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 04:58:00,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:58:00" (1/1) ... [2024-10-24 04:58:00,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@432f897d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:00, skipping insertion in model container [2024-10-24 04:58:00,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:58:00" (1/1) ... [2024-10-24 04:58:00,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 04:58:00,319 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c[1266,1279] [2024-10-24 04:58:00,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:58:00,415 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 04:58:00,429 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c[1266,1279] [2024-10-24 04:58:00,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:58:00,528 INFO L204 MainTranslator]: Completed translation [2024-10-24 04:58:00,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:00 WrapperNode [2024-10-24 04:58:00,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 04:58:00,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 04:58:00,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 04:58:00,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 04:58:00,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:00" (1/1) ... [2024-10-24 04:58:00,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:00" (1/1) ... [2024-10-24 04:58:00,650 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 413 [2024-10-24 04:58:00,651 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 04:58:00,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 04:58:00,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 04:58:00,652 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 04:58:00,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:00" (1/1) ... [2024-10-24 04:58:00,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:00" (1/1) ... [2024-10-24 04:58:00,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:00" (1/1) ... [2024-10-24 04:58:00,720 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 04:58:00,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:00" (1/1) ... [2024-10-24 04:58:00,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:00" (1/1) ... [2024-10-24 04:58:00,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:00" (1/1) ... [2024-10-24 04:58:00,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:00" (1/1) ... [2024-10-24 04:58:00,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:00" (1/1) ... [2024-10-24 04:58:00,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:00" (1/1) ... [2024-10-24 04:58:00,771 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 04:58:00,773 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 04:58:00,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 04:58:00,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 04:58:00,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:00" (1/1) ... [2024-10-24 04:58:00,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:58:00,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 04:58:00,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 04:58:00,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 04:58:00,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 04:58:00,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 04:58:00,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 04:58:00,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 04:58:00,967 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 04:58:00,969 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 04:58:01,523 INFO L? ?]: Removed 180 outVars from TransFormulas that were not future-live. [2024-10-24 04:58:01,524 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 04:58:01,563 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 04:58:01,565 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 04:58:01,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:58:01 BoogieIcfgContainer [2024-10-24 04:58:01,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 04:58:01,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 04:58:01,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 04:58:01,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 04:58:01,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:58:00" (1/3) ... [2024-10-24 04:58:01,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f044635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:58:01, skipping insertion in model container [2024-10-24 04:58:01,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:00" (2/3) ... [2024-10-24 04:58:01,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f044635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:58:01, skipping insertion in model container [2024-10-24 04:58:01,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:58:01" (3/3) ... [2024-10-24 04:58:01,575 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2024-10-24 04:58:01,595 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 04:58:01,596 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 04:58:01,648 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 04:58:01,655 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;@3d19d712, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 04:58:01,655 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 04:58:01,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 73 states have (on average 1.5068493150684932) internal successors, (110), 74 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 04:58:01,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:58:01,666 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] [2024-10-24 04:58:01,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:58:01,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:58:01,672 INFO L85 PathProgramCache]: Analyzing trace with hash -869249478, now seen corresponding path program 1 times [2024-10-24 04:58:01,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:58:01,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591717863] [2024-10-24 04:58:01,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:58:01,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:58:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:58:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:58:02,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:58:02,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591717863] [2024-10-24 04:58:02,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591717863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:58:02,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:58:02,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 04:58:02,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700166681] [2024-10-24 04:58:02,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:58:02,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:58:02,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:58:02,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:58:02,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:58:02,301 INFO L87 Difference]: Start difference. First operand has 75 states, 73 states have (on average 1.5068493150684932) internal successors, (110), 74 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:02,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:58:02,353 INFO L93 Difference]: Finished difference Result 122 states and 180 transitions. [2024-10-24 04:58:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:58:02,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2024-10-24 04:58:02,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:58:02,362 INFO L225 Difference]: With dead ends: 122 [2024-10-24 04:58:02,362 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 04:58:02,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:58:02,370 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:58:02,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:58:02,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 04:58:02,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-24 04:58:02,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 75 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:02,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 110 transitions. [2024-10-24 04:58:02,402 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 110 transitions. Word has length 28 [2024-10-24 04:58:02,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:58:02,403 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 110 transitions. [2024-10-24 04:58:02,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:02,403 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 110 transitions. [2024-10-24 04:58:02,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 04:58:02,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:58:02,405 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] [2024-10-24 04:58:02,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 04:58:02,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:58:02,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:58:02,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1175234733, now seen corresponding path program 1 times [2024-10-24 04:58:02,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:58:02,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830675198] [2024-10-24 04:58:02,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:58:02,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:58:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:58:02,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:58:02,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:58:02,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830675198] [2024-10-24 04:58:02,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830675198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:58:02,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:58:02,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 04:58:02,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005382816] [2024-10-24 04:58:02,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:58:02,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:58:02,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:58:02,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:58:02,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:58:02,572 INFO L87 Difference]: Start difference. First operand 76 states and 110 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:58:02,616 INFO L93 Difference]: Finished difference Result 125 states and 180 transitions. [2024-10-24 04:58:02,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:58:02,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2024-10-24 04:58:02,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:58:02,621 INFO L225 Difference]: With dead ends: 125 [2024-10-24 04:58:02,621 INFO L226 Difference]: Without dead ends: 78 [2024-10-24 04:58:02,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:58:02,623 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:58:02,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:58:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-24 04:58:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-24 04:58:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2024-10-24 04:58:02,633 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 29 [2024-10-24 04:58:02,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:58:02,634 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2024-10-24 04:58:02,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2024-10-24 04:58:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-24 04:58:02,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:58:02,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 04:58:02,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 04:58:02,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:58:02,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:58:02,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1124463155, now seen corresponding path program 1 times [2024-10-24 04:58:02,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:58:02,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098325906] [2024-10-24 04:58:02,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:58:02,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:58:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:58:02,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:58:02,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:58:02,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098325906] [2024-10-24 04:58:02,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098325906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:58:02,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:58:02,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 04:58:02,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963628530] [2024-10-24 04:58:02,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:58:02,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 04:58:02,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:58:02,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 04:58:02,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 04:58:02,952 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:03,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:58:03,061 INFO L93 Difference]: Finished difference Result 131 states and 187 transitions. [2024-10-24 04:58:03,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 04:58:03,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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 30 [2024-10-24 04:58:03,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:58:03,062 INFO L225 Difference]: With dead ends: 131 [2024-10-24 04:58:03,063 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 04:58:03,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 04:58:03,064 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 94 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 04:58:03,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 371 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 04:58:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 04:58:03,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2024-10-24 04:58:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.4375) internal successors, (115), 80 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-10-24 04:58:03,077 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 30 [2024-10-24 04:58:03,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:58:03,079 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-10-24 04:58:03,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:03,080 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-10-24 04:58:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-24 04:58:03,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:58:03,081 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] [2024-10-24 04:58:03,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 04:58:03,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:58:03,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:58:03,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1407506394, now seen corresponding path program 1 times [2024-10-24 04:58:03,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:58:03,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109423688] [2024-10-24 04:58:03,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:58:03,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:58:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:58:03,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:58:03,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:58:03,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109423688] [2024-10-24 04:58:03,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109423688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:58:03,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:58:03,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 04:58:03,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586279018] [2024-10-24 04:58:03,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:58:03,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 04:58:03,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:58:03,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 04:58:03,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 04:58:03,416 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:03,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:58:03,515 INFO L93 Difference]: Finished difference Result 137 states and 193 transitions. [2024-10-24 04:58:03,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 04:58:03,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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 31 [2024-10-24 04:58:03,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:58:03,518 INFO L225 Difference]: With dead ends: 137 [2024-10-24 04:58:03,520 INFO L226 Difference]: Without dead ends: 85 [2024-10-24 04:58:03,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 04:58:03,521 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 88 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 04:58:03,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 561 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 04:58:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-24 04:58:03,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-10-24 04:58:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.4375) internal successors, (115), 80 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-10-24 04:58:03,534 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 31 [2024-10-24 04:58:03,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:58:03,535 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-10-24 04:58:03,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:03,535 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-10-24 04:58:03,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-24 04:58:03,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:58:03,536 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] [2024-10-24 04:58:03,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 04:58:03,539 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:58:03,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:58:03,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2063164694, now seen corresponding path program 1 times [2024-10-24 04:58:03,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:58:03,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185423428] [2024-10-24 04:58:03,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:58:03,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:58:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 04:58:03,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 04:58:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 04:58:03,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 04:58:03,645 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 04:58:03,646 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 04:58:03,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 04:58:03,651 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-24 04:58:03,689 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 04:58:03,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:58:03 BoogieIcfgContainer [2024-10-24 04:58:03,693 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 04:58:03,697 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 04:58:03,697 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 04:58:03,697 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 04:58:03,698 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:58:01" (3/4) ... [2024-10-24 04:58:03,700 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 04:58:03,701 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 04:58:03,702 INFO L158 Benchmark]: Toolchain (without parser) took 3600.15ms. Allocated memory is still 195.0MB. Free memory was 128.9MB in the beginning and 60.4MB in the end (delta: 68.5MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2024-10-24 04:58:03,702 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 04:58:03,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.51ms. Allocated memory is still 195.0MB. Free memory was 128.7MB in the beginning and 167.2MB in the end (delta: -38.4MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2024-10-24 04:58:03,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.49ms. Allocated memory is still 195.0MB. Free memory was 166.9MB in the beginning and 159.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 04:58:03,703 INFO L158 Benchmark]: Boogie Preprocessor took 120.65ms. Allocated memory is still 195.0MB. Free memory was 159.6MB in the beginning and 153.6MB in the end (delta: 6.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 04:58:03,703 INFO L158 Benchmark]: RCFGBuilder took 792.24ms. Allocated memory is still 195.0MB. Free memory was 153.6MB in the beginning and 107.7MB in the end (delta: 45.9MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-24 04:58:03,704 INFO L158 Benchmark]: TraceAbstraction took 2126.36ms. Allocated memory is still 195.0MB. Free memory was 107.1MB in the beginning and 60.4MB in the end (delta: 46.7MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2024-10-24 04:58:03,704 INFO L158 Benchmark]: Witness Printer took 3.62ms. Allocated memory is still 195.0MB. Free memory is still 60.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 04:58:03,705 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.51ms. Allocated memory is still 195.0MB. Free memory was 128.7MB in the beginning and 167.2MB in the end (delta: -38.4MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.49ms. Allocated memory is still 195.0MB. Free memory was 166.9MB in the beginning and 159.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 120.65ms. Allocated memory is still 195.0MB. Free memory was 159.6MB in the beginning and 153.6MB in the end (delta: 6.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 792.24ms. Allocated memory is still 195.0MB. Free memory was 153.6MB in the beginning and 107.7MB in the end (delta: 45.9MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2126.36ms. Allocated memory is still 195.0MB. Free memory was 107.1MB in the beginning and 60.4MB in the end (delta: 46.7MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. * Witness Printer took 3.62ms. Allocated memory is still 195.0MB. Free memory is still 60.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 141. 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 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L35] const SORT_31 mask_SORT_31 = (SORT_31)-1 >> (sizeof(SORT_31) * 8 - 4); [L36] const SORT_31 msb_SORT_31 = (SORT_31)1 << (4 - 1); [L38] const SORT_67 mask_SORT_67 = (SORT_67)-1 >> (sizeof(SORT_67) * 8 - 10); [L39] const SORT_67 msb_SORT_67 = (SORT_67)1 << (10 - 1); [L41] const SORT_1 var_7 = 0; [L42] const SORT_10 var_12 = 0; [L43] const SORT_1 var_21 = 1; [L45] SORT_1 input_2; [L46] SORT_3 input_4; [L47] SORT_1 input_5; [L48] SORT_1 input_6; [L49] SORT_1 input_29; [L50] SORT_31 input_32; [L51] SORT_31 input_34; [L52] SORT_1 input_36; [L53] SORT_1 input_38; [L54] SORT_1 input_42; [L55] SORT_1 input_44; [L56] SORT_1 input_46; [L57] SORT_1 input_48; [L58] SORT_3 input_50; [L59] SORT_1 input_53; [L60] SORT_1 input_55; [L61] SORT_1 input_59; [L62] SORT_1 input_63; [L63] SORT_1 input_65; [L64] SORT_67 input_68; [L65] SORT_1 input_70; [L66] SORT_1 input_72; [L67] SORT_1 input_78; [L68] SORT_1 input_85; [L69] SORT_1 input_91; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L71] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L72] SORT_1 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L73] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L74] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L75] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L76] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L77] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] SORT_1 init_9_arg_1 = var_7; [L80] state_8 = init_9_arg_1 [L81] SORT_1 init_15_arg_1 = var_7; [L82] state_14 = init_15_arg_1 [L83] SORT_1 init_26_arg_1 = var_7; [L84] state_25 = init_26_arg_1 [L85] SORT_1 init_28_arg_1 = var_7; [L86] state_27 = init_28_arg_1 [L87] SORT_1 init_41_arg_1 = var_7; [L88] state_40 = init_41_arg_1 [L89] SORT_1 init_58_arg_1 = var_7; [L90] state_57 = init_58_arg_1 [L91] SORT_1 init_62_arg_1 = var_7; [L92] state_61 = init_62_arg_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L95] input_2 = __VERIFIER_nondet_uchar() [L96] input_4 = __VERIFIER_nondet_uchar() [L97] input_5 = __VERIFIER_nondet_uchar() [L98] input_6 = __VERIFIER_nondet_uchar() [L99] input_29 = __VERIFIER_nondet_uchar() [L100] input_32 = __VERIFIER_nondet_uchar() [L101] input_34 = __VERIFIER_nondet_uchar() [L102] input_36 = __VERIFIER_nondet_uchar() [L103] input_38 = __VERIFIER_nondet_uchar() [L104] input_42 = __VERIFIER_nondet_uchar() [L105] input_44 = __VERIFIER_nondet_uchar() [L106] input_46 = __VERIFIER_nondet_uchar() [L107] input_48 = __VERIFIER_nondet_uchar() [L108] input_50 = __VERIFIER_nondet_uchar() [L109] input_53 = __VERIFIER_nondet_uchar() [L110] input_55 = __VERIFIER_nondet_uchar() [L111] input_59 = __VERIFIER_nondet_uchar() [L112] input_63 = __VERIFIER_nondet_uchar() [L113] input_65 = __VERIFIER_nondet_uchar() [L114] input_68 = __VERIFIER_nondet_ushort() [L115] input_70 = __VERIFIER_nondet_uchar() [L116] input_72 = __VERIFIER_nondet_uchar() [L117] input_78 = __VERIFIER_nondet_uchar() [L118] input_85 = __VERIFIER_nondet_uchar() [L119] input_91 = __VERIFIER_nondet_uchar() [L122] SORT_1 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_11_arg_0=0, var_12=0, var_21=1, var_7=0] [L123] EXPR var_11_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L123] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L124] SORT_10 var_11 = var_11_arg_0; [L125] SORT_10 var_13_arg_0 = var_11; [L126] SORT_10 var_13_arg_1 = var_12; [L127] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L128] SORT_1 var_16_arg_0 = state_14; VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_13=1, var_16_arg_0=0, var_21=1, var_7=0] [L129] EXPR var_16_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_13=1, var_21=1, var_7=0] [L129] var_16_arg_0 = var_16_arg_0 & mask_SORT_1 [L130] SORT_10 var_16 = var_16_arg_0; [L131] SORT_10 var_17_arg_0 = var_16; [L132] SORT_10 var_17_arg_1 = var_12; [L133] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L134] SORT_1 var_18_arg_0 = var_13; [L135] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_7=0] [L136] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L136] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L137] SORT_1 var_22_arg_0 = var_18; [L138] SORT_1 var_22 = ~var_22_arg_0; [L139] SORT_1 var_23_arg_0 = var_21; [L140] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_23_arg_0=1, var_23_arg_1=-2, var_7=0] [L141] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L141] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L142] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_40=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L142] var_23 = var_23 & mask_SORT_1 [L143] SORT_1 bad_24_arg_0 = var_23; [L144] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 182 mSDsluCounter, 1549 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1148 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 181 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 401 mSDtfsCounter, 181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 04:58:03,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.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 3888704d5a955b45281a90f2156d0109c7e11fdda93c54cd78435365c9c632be --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 04:58:06,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 04:58:06,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-24 04:58:06,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 04:58:06,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 04:58:06,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 04:58:06,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 04:58:06,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 04:58:06,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 04:58:06,137 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 04:58:06,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 04:58:06,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 04:58:06,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 04:58:06,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 04:58:06,139 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 04:58:06,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 04:58:06,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 04:58:06,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 04:58:06,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 04:58:06,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 04:58:06,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 04:58:06,146 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 04:58:06,147 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 04:58:06,147 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 04:58:06,148 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 04:58:06,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 04:58:06,148 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 04:58:06,148 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 04:58:06,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 04:58:06,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 04:58:06,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 04:58:06,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:58:06,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 04:58:06,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 04:58:06,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 04:58:06,152 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 04:58:06,152 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 04:58:06,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 04:58:06,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 04:58:06,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 04:58:06,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 04:58:06,154 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 04:58:06,154 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 -> 3888704d5a955b45281a90f2156d0109c7e11fdda93c54cd78435365c9c632be [2024-10-24 04:58:06,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 04:58:06,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 04:58:06,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 04:58:06,495 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 04:58:06,496 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 04:58:06,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2024-10-24 04:58:08,099 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 04:58:08,307 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 04:58:08,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2024-10-24 04:58:08,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/684b06bb6/a8409b37eb3344fa85b193267f15eaad/FLAG5bb8b7fd8 [2024-10-24 04:58:08,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/684b06bb6/a8409b37eb3344fa85b193267f15eaad [2024-10-24 04:58:08,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 04:58:08,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 04:58:08,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 04:58:08,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 04:58:08,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 04:58:08,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:58:08" (1/1) ... [2024-10-24 04:58:08,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@363eaaa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:08, skipping insertion in model container [2024-10-24 04:58:08,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:58:08" (1/1) ... [2024-10-24 04:58:08,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 04:58:08,577 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c[1266,1279] [2024-10-24 04:58:08,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:58:08,679 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 04:58:08,694 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c[1266,1279] [2024-10-24 04:58:08,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:58:08,763 INFO L204 MainTranslator]: Completed translation [2024-10-24 04:58:08,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:08 WrapperNode [2024-10-24 04:58:08,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 04:58:08,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 04:58:08,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 04:58:08,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 04:58:08,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:08" (1/1) ... [2024-10-24 04:58:08,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:08" (1/1) ... [2024-10-24 04:58:08,828 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 277 [2024-10-24 04:58:08,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 04:58:08,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 04:58:08,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 04:58:08,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 04:58:08,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:08" (1/1) ... [2024-10-24 04:58:08,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:08" (1/1) ... [2024-10-24 04:58:08,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:08" (1/1) ... [2024-10-24 04:58:08,884 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 04:58:08,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:08" (1/1) ... [2024-10-24 04:58:08,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:08" (1/1) ... [2024-10-24 04:58:08,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:08" (1/1) ... [2024-10-24 04:58:08,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:08" (1/1) ... [2024-10-24 04:58:08,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:08" (1/1) ... [2024-10-24 04:58:08,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:08" (1/1) ... [2024-10-24 04:58:08,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 04:58:08,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 04:58:08,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 04:58:08,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 04:58:08,918 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:08" (1/1) ... [2024-10-24 04:58:08,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:58:08,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 04:58:08,957 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 04:58:08,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 04:58:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 04:58:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 04:58:09,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 04:58:09,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 04:58:09,103 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 04:58:09,108 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 04:58:09,409 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-10-24 04:58:09,409 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 04:58:09,443 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 04:58:09,443 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 04:58:09,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:58:09 BoogieIcfgContainer [2024-10-24 04:58:09,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 04:58:09,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 04:58:09,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 04:58:09,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 04:58:09,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:58:08" (1/3) ... [2024-10-24 04:58:09,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2281c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:58:09, skipping insertion in model container [2024-10-24 04:58:09,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:08" (2/3) ... [2024-10-24 04:58:09,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2281c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:58:09, skipping insertion in model container [2024-10-24 04:58:09,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:58:09" (3/3) ... [2024-10-24 04:58:09,453 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2024-10-24 04:58:09,471 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 04:58:09,472 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 04:58:09,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 04:58:09,540 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;@60977540, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 04:58:09,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 04:58:09,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 04:58:09,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:58:09,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 04:58:09,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:58:09,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:58:09,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-24 04:58:09,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:58:09,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744799007] [2024-10-24 04:58:09,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:58:09,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:58:09,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:58:09,568 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 04:58:09,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 04:58:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:58:09,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 04:58:09,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:58:09,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:58:09,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 04:58:09,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 04:58:09,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744799007] [2024-10-24 04:58:09,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744799007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:58:09,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:58:09,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 04:58:09,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939011265] [2024-10-24 04:58:09,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:58:10,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:58:10,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 04:58:10,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:58:10,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:58:10,026 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:58:10,080 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-24 04:58:10,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:58:10,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-24 04:58:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:58:10,090 INFO L225 Difference]: With dead ends: 15 [2024-10-24 04:58:10,091 INFO L226 Difference]: Without dead ends: 9 [2024-10-24 04:58:10,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 04:58:10,099 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:58:10,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:58:10,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-24 04:58:10,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-24 04:58:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-24 04:58:10,128 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-24 04:58:10,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:58:10,129 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-24 04:58:10,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-24 04:58:10,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 04:58:10,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:58:10,131 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-24 04:58:10,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 04:58:10,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:58:10,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:58:10,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:58:10,335 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-24 04:58:10,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:58:10,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948455529] [2024-10-24 04:58:10,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:58:10,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:58:10,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:58:10,338 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 04:58:10,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 04:58:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:58:10,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 04:58:10,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:58:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:58:10,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 04:58:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:58:11,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 04:58:11,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948455529] [2024-10-24 04:58:11,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948455529] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 04:58:11,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 04:58:11,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-24 04:58:11,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123242049] [2024-10-24 04:58:11,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 04:58:11,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 04:58:11,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 04:58:11,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 04:58:11,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 04:58:11,456 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:58:11,570 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-24 04:58:11,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 04:58:11,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 04:58:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:58:11,571 INFO L225 Difference]: With dead ends: 14 [2024-10-24 04:58:11,571 INFO L226 Difference]: Without dead ends: 12 [2024-10-24 04:58:11,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-24 04:58:11,573 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 04:58:11,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 04:58:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-24 04:58:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-10-24 04:58:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-24 04:58:11,577 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-24 04:58:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:58:11,577 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-24 04:58:11,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-24 04:58:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 04:58:11,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:58:11,579 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-24 04:58:11,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 04:58:11,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:58:11,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:58:11,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:58:11,781 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-24 04:58:11,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:58:11,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458161537] [2024-10-24 04:58:11,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 04:58:11,782 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:58:11,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:58:11,785 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 04:58:11,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 04:58:11,921 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 04:58:11,921 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 04:58:11,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 04:58:11,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:58:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:58:12,159 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 04:58:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:58:18,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 04:58:18,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458161537] [2024-10-24 04:58:18,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458161537] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 04:58:18,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 04:58:18,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-24 04:58:18,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865787263] [2024-10-24 04:58:18,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 04:58:18,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 04:58:18,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 04:58:18,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 04:58:18,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 04:58:18,429 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:58:18,542 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-10-24 04:58:18,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 04:58:18,542 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-24 04:58:18,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:58:18,543 INFO L225 Difference]: With dead ends: 17 [2024-10-24 04:58:18,543 INFO L226 Difference]: Without dead ends: 15 [2024-10-24 04:58:18,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-24 04:58:18,545 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 04:58:18,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 04:58:18,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-24 04:58:18,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-24 04:58:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-24 04:58:18,549 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2024-10-24 04:58:18,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:58:18,549 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-24 04:58:18,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-24 04:58:18,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 04:58:18,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:58:18,550 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-24 04:58:18,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 04:58:18,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:58:18,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:58:18,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:58:18,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 3 times [2024-10-24 04:58:18,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:58:18,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883791657] [2024-10-24 04:58:18,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 04:58:18,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:58:18,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:58:18,756 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 04:58:18,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 04:58:18,893 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-24 04:58:18,894 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 04:58:18,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 04:58:18,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:58:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 04:58:19,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 04:58:21,513 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 04:58:21,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 04:58:21,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883791657] [2024-10-24 04:58:21,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883791657] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 04:58:21,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 04:58:21,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-24 04:58:21,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91502759] [2024-10-24 04:58:21,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 04:58:21,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 04:58:21,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 04:58:21,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 04:58:21,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 04:58:21,516 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-10-24 04:58:21,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:58:21,561 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-24 04:58:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:58:21,562 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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 13 [2024-10-24 04:58:21,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:58:21,562 INFO L225 Difference]: With dead ends: 14 [2024-10-24 04:58:21,562 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 04:58:21,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-24 04:58:21,564 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:58:21,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:58:21,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 04:58:21,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 04:58:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 04:58:21,565 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2024-10-24 04:58:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:58:21,566 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 04:58:21,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-10-24 04:58:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 04:58:21,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 04:58:21,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 04:58:21,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 04:58:21,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:58:21,775 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-24 04:58:21,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 04:58:21,825 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 04:58:21,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:58:21 BoogieIcfgContainer [2024-10-24 04:58:21,835 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 04:58:21,836 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 04:58:21,836 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 04:58:21,836 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 04:58:21,836 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:58:09" (3/4) ... [2024-10-24 04:58:21,838 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 04:58:21,847 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-24 04:58:21,847 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-24 04:58:21,848 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 04:58:21,848 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 04:58:21,974 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 04:58:21,975 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 04:58:21,975 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 04:58:21,976 INFO L158 Benchmark]: Toolchain (without parser) took 13636.08ms. Allocated memory was 60.8MB in the beginning and 377.5MB in the end (delta: 316.7MB). Free memory was 27.0MB in the beginning and 285.0MB in the end (delta: -258.0MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. [2024-10-24 04:58:21,976 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 48.2MB. Free memory was 29.6MB in the beginning and 29.6MB in the end (delta: 60.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 04:58:21,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.70ms. Allocated memory is still 60.8MB. Free memory was 26.8MB in the beginning and 25.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2024-10-24 04:58:21,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.20ms. Allocated memory is still 60.8MB. Free memory was 25.5MB in the beginning and 40.6MB in the end (delta: -15.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 04:58:21,977 INFO L158 Benchmark]: Boogie Preprocessor took 82.82ms. Allocated memory is still 60.8MB. Free memory was 40.6MB in the beginning and 37.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 04:58:21,978 INFO L158 Benchmark]: RCFGBuilder took 528.59ms. Allocated memory is still 60.8MB. Free memory was 37.5MB in the beginning and 28.7MB in the end (delta: 8.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 04:58:21,978 INFO L158 Benchmark]: TraceAbstraction took 12387.93ms. Allocated memory was 60.8MB in the beginning and 377.5MB in the end (delta: 316.7MB). Free memory was 28.1MB in the beginning and 291.3MB in the end (delta: -263.2MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2024-10-24 04:58:21,978 INFO L158 Benchmark]: Witness Printer took 139.77ms. Allocated memory is still 377.5MB. Free memory was 291.3MB in the beginning and 285.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 04:58:21,980 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.17ms. Allocated memory is still 48.2MB. Free memory was 29.6MB in the beginning and 29.6MB in the end (delta: 60.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.70ms. Allocated memory is still 60.8MB. Free memory was 26.8MB in the beginning and 25.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.20ms. Allocated memory is still 60.8MB. Free memory was 25.5MB in the beginning and 40.6MB in the end (delta: -15.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.82ms. Allocated memory is still 60.8MB. Free memory was 40.6MB in the beginning and 37.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 528.59ms. Allocated memory is still 60.8MB. Free memory was 37.5MB in the beginning and 28.7MB in the end (delta: 8.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12387.93ms. Allocated memory was 60.8MB in the beginning and 377.5MB in the end (delta: 316.7MB). Free memory was 28.1MB in the beginning and 291.3MB in the end (delta: -263.2MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. * Witness Printer took 139.77ms. Allocated memory is still 377.5MB. Free memory was 291.3MB in the beginning and 285.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 6 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=3, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 34 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 57 ConstructedInterpolants, 22 QuantifiedInterpolants, 16118 SizeOfPredicates, 31 NumberOfNonLiveVariables, 300 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 18/48 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((0 == var_7) && (0 == var_12)) && ((0 == state_8) || (0 == state_14))) && (1 == mask_SORT_1)) RESULT: Ultimate proved your program to be correct! [2024-10-24 04:58:22,015 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 Writing output log to file Ultimate.log Result: TRUE