./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 a046e57d 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-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:39:27,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:39:27,784 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 23:39:27,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:39:27,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:39:27,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:39:27,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:39:27,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:39:27,822 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:39:27,822 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:39:27,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:39:27,823 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:39:27,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:39:27,824 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:39:27,824 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:39:27,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:39:27,825 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:39:27,825 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:39:27,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:39:27,826 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:39:27,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:39:27,830 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:39:27,831 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:39:27,831 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:39:27,831 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:39:27,831 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:39:27,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:39:27,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:39:27,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:39:27,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:39:27,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:39:27,833 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:39:27,833 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:39:27,833 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:39:27,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:39:27,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:39:27,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:39:27,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:39:27,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:39:27,835 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-12 23:39:28,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:39:28,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:39:28,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:39:28,112 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:39:28,113 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:39:28,114 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-12 23:39:29,545 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:39:29,744 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:39:29,744 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-12 23:39:29,773 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c61b1acc/7e0df784478f4b73a9704059cceff79f/FLAG9a2943b66 [2024-10-12 23:39:29,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c61b1acc/7e0df784478f4b73a9704059cceff79f [2024-10-12 23:39:29,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:39:29,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:39:29,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:39:29,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:39:29,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:39:29,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:39:29" (1/1) ... [2024-10-12 23:39:29,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6264316f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:29, skipping insertion in model container [2024-10-12 23:39:29,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:39:29" (1/1) ... [2024-10-12 23:39:29,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:39:30,009 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-12 23:39:30,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:39:30,109 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:39:30,120 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-12 23:39:30,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:39:30,189 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:39:30,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:30 WrapperNode [2024-10-12 23:39:30,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:39:30,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:39:30,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:39:30,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:39:30,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:30" (1/1) ... [2024-10-12 23:39:30,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:30" (1/1) ... [2024-10-12 23:39:30,269 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 413 [2024-10-12 23:39:30,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:39:30,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:39:30,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:39:30,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:39:30,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:30" (1/1) ... [2024-10-12 23:39:30,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:30" (1/1) ... [2024-10-12 23:39:30,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:30" (1/1) ... [2024-10-12 23:39:30,317 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-12 23:39:30,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:30" (1/1) ... [2024-10-12 23:39:30,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:30" (1/1) ... [2024-10-12 23:39:30,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:30" (1/1) ... [2024-10-12 23:39:30,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:30" (1/1) ... [2024-10-12 23:39:30,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:30" (1/1) ... [2024-10-12 23:39:30,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:30" (1/1) ... [2024-10-12 23:39:30,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:39:30,363 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:39:30,364 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:39:30,364 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:39:30,365 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:30" (1/1) ... [2024-10-12 23:39:30,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:39:30,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:39:30,399 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-12 23:39:30,402 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-12 23:39:30,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:39:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:39:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:39:30,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:39:30,566 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:39:30,568 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:39:31,157 INFO L? ?]: Removed 180 outVars from TransFormulas that were not future-live. [2024-10-12 23:39:31,158 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:39:31,186 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:39:31,186 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:39:31,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:39:31 BoogieIcfgContainer [2024-10-12 23:39:31,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:39:31,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:39:31,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:39:31,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:39:31,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:39:29" (1/3) ... [2024-10-12 23:39:31,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f71455d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:39:31, skipping insertion in model container [2024-10-12 23:39:31,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:30" (2/3) ... [2024-10-12 23:39:31,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f71455d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:39:31, skipping insertion in model container [2024-10-12 23:39:31,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:39:31" (3/3) ... [2024-10-12 23:39:31,196 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2024-10-12 23:39:31,213 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:39:31,214 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:39:31,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:39:31,282 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;@3042482f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:39:31,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:39:31,287 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-12 23:39:31,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 23:39:31,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:39:31,295 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-12 23:39:31,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:39:31,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:39:31,301 INFO L85 PathProgramCache]: Analyzing trace with hash -869249478, now seen corresponding path program 1 times [2024-10-12 23:39:31,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:39:31,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186465318] [2024-10-12 23:39:31,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:39:31,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:39:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:39:31,946 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-12 23:39:31,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:39:31,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186465318] [2024-10-12 23:39:31,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186465318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:39:31,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:39:31,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:39:31,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680992661] [2024-10-12 23:39:31,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:39:31,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:39:31,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:39:31,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:39:31,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:39:31,990 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-12 23:39:32,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:39:32,045 INFO L93 Difference]: Finished difference Result 122 states and 180 transitions. [2024-10-12 23:39:32,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:39:32,048 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-12 23:39:32,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:39:32,056 INFO L225 Difference]: With dead ends: 122 [2024-10-12 23:39:32,056 INFO L226 Difference]: Without dead ends: 76 [2024-10-12 23:39:32,059 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-12 23:39:32,063 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-12 23:39:32,063 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-12 23:39:32,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-12 23:39:32,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-12 23:39:32,092 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-12 23:39:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 110 transitions. [2024-10-12 23:39:32,098 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 110 transitions. Word has length 28 [2024-10-12 23:39:32,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:39:32,098 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 110 transitions. [2024-10-12 23:39:32,098 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-12 23:39:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 110 transitions. [2024-10-12 23:39:32,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 23:39:32,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:39:32,099 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-12 23:39:32,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:39:32,100 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:39:32,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:39:32,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1175234733, now seen corresponding path program 1 times [2024-10-12 23:39:32,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:39:32,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911323604] [2024-10-12 23:39:32,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:39:32,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:39:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:39:32,264 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-12 23:39:32,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:39:32,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911323604] [2024-10-12 23:39:32,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911323604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:39:32,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:39:32,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:39:32,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950125942] [2024-10-12 23:39:32,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:39:32,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:39:32,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:39:32,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:39:32,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:39:32,268 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-12 23:39:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:39:32,297 INFO L93 Difference]: Finished difference Result 125 states and 180 transitions. [2024-10-12 23:39:32,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:39:32,298 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-12 23:39:32,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:39:32,299 INFO L225 Difference]: With dead ends: 125 [2024-10-12 23:39:32,299 INFO L226 Difference]: Without dead ends: 78 [2024-10-12 23:39:32,299 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-12 23:39:32,301 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-12 23:39:32,301 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-12 23:39:32,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-12 23:39:32,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-12 23:39:32,312 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-12 23:39:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2024-10-12 23:39:32,315 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 29 [2024-10-12 23:39:32,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:39:32,316 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2024-10-12 23:39:32,316 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-12 23:39:32,316 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2024-10-12 23:39:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-12 23:39:32,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:39:32,319 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-12 23:39:32,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 23:39:32,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:39:32,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:39:32,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1124463155, now seen corresponding path program 1 times [2024-10-12 23:39:32,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:39:32,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363613816] [2024-10-12 23:39:32,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:39:32,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:39:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:39:32,599 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-12 23:39:32,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:39:32,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363613816] [2024-10-12 23:39:32,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363613816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:39:32,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:39:32,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:39:32,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622718302] [2024-10-12 23:39:32,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:39:32,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 23:39:32,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:39:32,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 23:39:32,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:39:32,603 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-12 23:39:32,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:39:32,705 INFO L93 Difference]: Finished difference Result 131 states and 187 transitions. [2024-10-12 23:39:32,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 23:39:32,707 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-12 23:39:32,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:39:32,710 INFO L225 Difference]: With dead ends: 131 [2024-10-12 23:39:32,710 INFO L226 Difference]: Without dead ends: 82 [2024-10-12 23:39:32,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:39:32,712 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-12 23:39:32,714 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-12 23:39:32,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-12 23:39:32,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2024-10-12 23:39:32,723 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-12 23:39:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-10-12 23:39:32,725 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 30 [2024-10-12 23:39:32,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:39:32,725 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-10-12 23:39:32,726 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-12 23:39:32,726 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-10-12 23:39:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 23:39:32,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:39:32,727 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-12 23:39:32,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 23:39:32,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:39:32,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:39:32,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1407506394, now seen corresponding path program 1 times [2024-10-12 23:39:32,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:39:32,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081678322] [2024-10-12 23:39:32,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:39:32,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:39:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:39:33,109 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-12 23:39:33,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:39:33,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081678322] [2024-10-12 23:39:33,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081678322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:39:33,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:39:33,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 23:39:33,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088438753] [2024-10-12 23:39:33,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:39:33,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 23:39:33,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:39:33,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 23:39:33,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:39:33,112 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-12 23:39:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:39:33,229 INFO L93 Difference]: Finished difference Result 137 states and 193 transitions. [2024-10-12 23:39:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:39:33,230 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-12 23:39:33,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:39:33,231 INFO L225 Difference]: With dead ends: 137 [2024-10-12 23:39:33,231 INFO L226 Difference]: Without dead ends: 85 [2024-10-12 23:39:33,231 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-12 23:39:33,232 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-12 23:39:33,233 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-12 23:39:33,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-12 23:39:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-10-12 23:39:33,238 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-12 23:39:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-10-12 23:39:33,238 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 31 [2024-10-12 23:39:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:39:33,239 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-10-12 23:39:33,239 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-12 23:39:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-10-12 23:39:33,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 23:39:33,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:39:33,240 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-12 23:39:33,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 23:39:33,240 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:39:33,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:39:33,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2063164694, now seen corresponding path program 1 times [2024-10-12 23:39:33,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:39:33,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656561442] [2024-10-12 23:39:33,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:39:33,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:39:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:39:33,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:39:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:39:33,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 23:39:33,336 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:39:33,337 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:39:33,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 23:39:33,342 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-12 23:39:33,387 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:39:33,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:39:33 BoogieIcfgContainer [2024-10-12 23:39:33,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:39:33,393 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:39:33,393 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:39:33,393 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:39:33,394 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:39:31" (3/4) ... [2024-10-12 23:39:33,397 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 23:39:33,398 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:39:33,399 INFO L158 Benchmark]: Toolchain (without parser) took 3607.30ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 119.3MB in the beginning and 47.5MB in the end (delta: 71.9MB). Peak memory consumption was 107.9MB. Max. memory is 16.1GB. [2024-10-12 23:39:33,399 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:39:33,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.73ms. Allocated memory is still 151.0MB. Free memory was 118.9MB in the beginning and 101.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 23:39:33,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.18ms. Allocated memory is still 151.0MB. Free memory was 101.3MB in the beginning and 93.3MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 23:39:33,400 INFO L158 Benchmark]: Boogie Preprocessor took 91.36ms. Allocated memory is still 151.0MB. Free memory was 93.3MB in the beginning and 87.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 23:39:33,400 INFO L158 Benchmark]: RCFGBuilder took 824.20ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 87.9MB in the beginning and 131.0MB in the end (delta: -43.2MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2024-10-12 23:39:33,401 INFO L158 Benchmark]: TraceAbstraction took 2202.85ms. Allocated memory is still 186.6MB. Free memory was 129.9MB in the beginning and 47.5MB in the end (delta: 82.5MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2024-10-12 23:39:33,401 INFO L158 Benchmark]: Witness Printer took 5.13ms. Allocated memory is still 186.6MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:39:33,402 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.73ms. Allocated memory is still 151.0MB. Free memory was 118.9MB in the beginning and 101.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.18ms. Allocated memory is still 151.0MB. Free memory was 101.3MB in the beginning and 93.3MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.36ms. Allocated memory is still 151.0MB. Free memory was 93.3MB in the beginning and 87.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 824.20ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 87.9MB in the beginning and 131.0MB in the end (delta: -43.2MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2202.85ms. Allocated memory is still 186.6MB. Free memory was 129.9MB in the beginning and 47.5MB in the end (delta: 82.5MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. * Witness Printer took 5.13ms. Allocated memory is still 186.6MB. Free memory is still 47.5MB. 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.1s, 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.2s 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.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s 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-12 23:39:33,441 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-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:39:35,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:39:35,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-12 23:39:35,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:39:35,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:39:35,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:39:35,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:39:35,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:39:35,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:39:35,717 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:39:35,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:39:35,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:39:35,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:39:35,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:39:35,719 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:39:35,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:39:35,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:39:35,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:39:35,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:39:35,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:39:35,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:39:35,726 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 23:39:35,726 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 23:39:35,726 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:39:35,726 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 23:39:35,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:39:35,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:39:35,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:39:35,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:39:35,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:39:35,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:39:35,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:39:35,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:39:35,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:39:35,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:39:35,737 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 23:39:35,737 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 23:39:35,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:39:35,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:39:35,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:39:35,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:39:35,738 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 23:39:35,738 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-12 23:39:36,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:39:36,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:39:36,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:39:36,083 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:39:36,084 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:39:36,085 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-12 23:39:37,688 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:39:37,910 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:39:37,911 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-12 23:39:37,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa3498314/4d9c523929de499e9bf4f7122bb8552f/FLAGdda7b4abe [2024-10-12 23:39:38,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa3498314/4d9c523929de499e9bf4f7122bb8552f [2024-10-12 23:39:38,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:39:38,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:39:38,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:39:38,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:39:38,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:39:38,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:39:38" (1/1) ... [2024-10-12 23:39:38,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@460e339f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:38, skipping insertion in model container [2024-10-12 23:39:38,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:39:38" (1/1) ... [2024-10-12 23:39:38,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:39:38,501 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-12 23:39:38,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:39:38,599 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:39:38,614 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-12 23:39:38,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:39:38,683 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:39:38,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:38 WrapperNode [2024-10-12 23:39:38,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:39:38,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:39:38,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:39:38,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:39:38,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:38" (1/1) ... [2024-10-12 23:39:38,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:38" (1/1) ... [2024-10-12 23:39:38,746 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 277 [2024-10-12 23:39:38,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:39:38,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:39:38,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:39:38,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:39:38,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:38" (1/1) ... [2024-10-12 23:39:38,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:38" (1/1) ... [2024-10-12 23:39:38,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:38" (1/1) ... [2024-10-12 23:39:38,779 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-12 23:39:38,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:38" (1/1) ... [2024-10-12 23:39:38,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:38" (1/1) ... [2024-10-12 23:39:38,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:38" (1/1) ... [2024-10-12 23:39:38,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:38" (1/1) ... [2024-10-12 23:39:38,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:38" (1/1) ... [2024-10-12 23:39:38,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:38" (1/1) ... [2024-10-12 23:39:38,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:39:38,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:39:38,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:39:38,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:39:38,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:38" (1/1) ... [2024-10-12 23:39:38,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:39:38,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:39:38,849 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-12 23:39:38,856 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-12 23:39:38,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:39:38,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 23:39:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:39:38,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:39:38,999 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:39:39,005 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:39:39,309 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-10-12 23:39:39,309 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:39:39,354 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:39:39,355 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:39:39,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:39:39 BoogieIcfgContainer [2024-10-12 23:39:39,356 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:39:39,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:39:39,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:39:39,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:39:39,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:39:38" (1/3) ... [2024-10-12 23:39:39,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192726d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:39:39, skipping insertion in model container [2024-10-12 23:39:39,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:38" (2/3) ... [2024-10-12 23:39:39,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192726d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:39:39, skipping insertion in model container [2024-10-12 23:39:39,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:39:39" (3/3) ... [2024-10-12 23:39:39,365 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p08.c [2024-10-12 23:39:39,382 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:39:39,383 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:39:39,446 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:39:39,454 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;@47e75511, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:39:39,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:39:39,458 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-12 23:39:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-12 23:39:39,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:39:39,465 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-12 23:39:39,466 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:39:39,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:39:39,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-12 23:39:39,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:39:39,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828835265] [2024-10-12 23:39:39,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:39:39,486 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-12 23:39:39,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:39:39,489 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-12 23:39:39,490 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-12 23:39:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:39:39,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 23:39:39,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:39:39,842 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-12 23:39:39,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:39:39,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:39:39,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828835265] [2024-10-12 23:39:39,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828835265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:39:39,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:39:39,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:39:39,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494262118] [2024-10-12 23:39:39,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:39:39,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:39:39,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:39:39,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:39:39,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:39:39,880 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-12 23:39:39,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:39:39,939 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-12 23:39:39,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:39:39,941 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-12 23:39:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:39:39,948 INFO L225 Difference]: With dead ends: 15 [2024-10-12 23:39:39,948 INFO L226 Difference]: Without dead ends: 9 [2024-10-12 23:39:39,951 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-12 23:39:39,955 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-12 23:39:39,956 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-12 23:39:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-12 23:39:39,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-12 23:39:39,979 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-12 23:39:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-12 23:39:39,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-12 23:39:39,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:39:39,981 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-12 23:39:39,981 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-12 23:39:39,981 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-12 23:39:39,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 23:39:39,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:39:39,982 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-12 23:39:39,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-12 23:39:40,184 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-12 23:39:40,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:39:40,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:39:40,186 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-12 23:39:40,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:39:40,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306738236] [2024-10-12 23:39:40,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:39:40,187 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-12 23:39:40,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:39:40,188 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-12 23:39:40,190 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-12 23:39:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:39:40,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 23:39:40,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:39:40,511 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-12 23:39:40,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:39:41,365 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-12 23:39:41,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:39:41,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306738236] [2024-10-12 23:39:41,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306738236] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:39:41,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:39:41,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-12 23:39:41,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505850386] [2024-10-12 23:39:41,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 23:39:41,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 23:39:41,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:39:41,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 23:39:41,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:39:41,371 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-12 23:39:41,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:39:41,480 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-12 23:39:41,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 23:39:41,482 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-12 23:39:41,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:39:41,482 INFO L225 Difference]: With dead ends: 14 [2024-10-12 23:39:41,482 INFO L226 Difference]: Without dead ends: 12 [2024-10-12 23:39:41,483 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-12 23:39:41,484 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-12 23:39:41,485 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-12 23:39:41,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-12 23:39:41,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-10-12 23:39:41,490 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-12 23:39:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-12 23:39:41,491 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-12 23:39:41,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:39:41,491 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-12 23:39:41,492 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-12 23:39:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-12 23:39:41,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 23:39:41,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:39:41,492 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-12 23:39:41,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-12 23:39:41,693 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-12 23:39:41,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:39:41,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:39:41,694 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-12 23:39:41,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:39:41,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577814348] [2024-10-12 23:39:41,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 23:39:41,699 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-12 23:39:41,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:39:41,700 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-12 23:39:41,702 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-12 23:39:41,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 23:39:41,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 23:39:41,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-12 23:39:41,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:39:42,083 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-12 23:39:42,083 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:39:48,325 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-12 23:39:48,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:39:48,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577814348] [2024-10-12 23:39:48,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577814348] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:39:48,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:39:48,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-12 23:39:48,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484011716] [2024-10-12 23:39:48,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 23:39:48,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 23:39:48,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:39:48,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 23:39:48,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:39:48,329 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-12 23:39:48,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:39:48,473 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-10-12 23:39:48,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 23:39:48,474 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-12 23:39:48,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:39:48,475 INFO L225 Difference]: With dead ends: 17 [2024-10-12 23:39:48,475 INFO L226 Difference]: Without dead ends: 15 [2024-10-12 23:39:48,475 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-12 23:39:48,476 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 23:39:48,477 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-12 23:39:48,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-12 23:39:48,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-12 23:39:48,480 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-12 23:39:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-12 23:39:48,481 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2024-10-12 23:39:48,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:39:48,481 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-12 23:39:48,482 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-12 23:39:48,482 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-12 23:39:48,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 23:39:48,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:39:48,482 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-12 23:39:48,487 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 (4)] Forceful destruction successful, exit code 0 [2024-10-12 23:39:48,683 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-12 23:39:48,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:39:48,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:39:48,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 3 times [2024-10-12 23:39:48,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:39:48,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759134156] [2024-10-12 23:39:48,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 23:39:48,685 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-12 23:39:48,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:39:48,688 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-12 23:39:48,689 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-12 23:39:48,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-12 23:39:48,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 23:39:48,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-12 23:39:48,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:39:49,139 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-12 23:39:49,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:39:51,397 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-12 23:39:51,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:39:51,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759134156] [2024-10-12 23:39:51,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759134156] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:39:51,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:39:51,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-12 23:39:51,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820872762] [2024-10-12 23:39:51,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 23:39:51,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 23:39:51,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:39:51,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 23:39:51,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:39:51,400 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-12 23:39:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:39:51,448 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-12 23:39:51,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:39:51,449 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-12 23:39:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:39:51,449 INFO L225 Difference]: With dead ends: 14 [2024-10-12 23:39:51,449 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 23:39:51,450 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-12 23:39:51,450 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-12 23:39:51,451 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-12 23:39:51,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 23:39:51,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 23:39:51,452 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-12 23:39:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 23:39:51,452 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2024-10-12 23:39:51,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:39:51,452 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 23:39:51,452 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-12 23:39:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 23:39:51,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 23:39:51,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:39:51,459 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-12 23:39:51,655 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-12 23:39:51,658 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-12 23:39:51,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 23:39:51,704 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:39:51,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:39:51 BoogieIcfgContainer [2024-10-12 23:39:51,716 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:39:51,716 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:39:51,716 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:39:51,716 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:39:51,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:39:39" (3/4) ... [2024-10-12 23:39:51,718 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 23:39:51,726 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 23:39:51,727 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-12 23:39:51,728 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 23:39:51,728 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 23:39:51,843 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 23:39:51,844 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 23:39:51,844 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:39:51,845 INFO L158 Benchmark]: Toolchain (without parser) took 13576.18ms. Allocated memory was 62.9MB in the beginning and 383.8MB in the end (delta: 320.9MB). Free memory was 26.3MB in the beginning and 215.4MB in the end (delta: -189.1MB). Peak memory consumption was 129.9MB. Max. memory is 16.1GB. [2024-10-12 23:39:51,845 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 44.0MB. Free memory was 27.8MB in the beginning and 27.7MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:39:51,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.44ms. Allocated memory is still 62.9MB. Free memory was 26.1MB in the beginning and 28.4MB in the end (delta: -2.4MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2024-10-12 23:39:51,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.47ms. Allocated memory is still 62.9MB. Free memory was 28.4MB in the beginning and 25.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 23:39:51,846 INFO L158 Benchmark]: Boogie Preprocessor took 68.94ms. Allocated memory was 62.9MB in the beginning and 100.7MB in the end (delta: 37.7MB). Free memory was 25.7MB in the beginning and 79.6MB in the end (delta: -53.9MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2024-10-12 23:39:51,846 INFO L158 Benchmark]: RCFGBuilder took 539.15ms. Allocated memory is still 100.7MB. Free memory was 79.6MB in the beginning and 53.9MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 23:39:51,847 INFO L158 Benchmark]: TraceAbstraction took 12356.56ms. Allocated memory was 100.7MB in the beginning and 383.8MB in the end (delta: 283.1MB). Free memory was 53.3MB in the beginning and 222.8MB in the end (delta: -169.5MB). Peak memory consumption was 114.3MB. Max. memory is 16.1GB. [2024-10-12 23:39:51,847 INFO L158 Benchmark]: Witness Printer took 128.24ms. Allocated memory is still 383.8MB. Free memory was 222.8MB in the beginning and 215.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 23:39:51,849 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.25ms. Allocated memory is still 44.0MB. Free memory was 27.8MB in the beginning and 27.7MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.44ms. Allocated memory is still 62.9MB. Free memory was 26.1MB in the beginning and 28.4MB in the end (delta: -2.4MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.47ms. Allocated memory is still 62.9MB. Free memory was 28.4MB in the beginning and 25.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.94ms. Allocated memory was 62.9MB in the beginning and 100.7MB in the end (delta: 37.7MB). Free memory was 25.7MB in the beginning and 79.6MB in the end (delta: -53.9MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * RCFGBuilder took 539.15ms. Allocated memory is still 100.7MB. Free memory was 79.6MB in the beginning and 53.9MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12356.56ms. Allocated memory was 100.7MB in the beginning and 383.8MB in the end (delta: 283.1MB). Free memory was 53.3MB in the beginning and 222.8MB in the end (delta: -169.5MB). Peak memory consumption was 114.3MB. Max. memory is 16.1GB. * Witness Printer took 128.24ms. Allocated memory is still 383.8MB. Free memory was 222.8MB in the beginning and 215.4MB in the end (delta: 7.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.2s, 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.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.2s 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.7s 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-12 23:39:51,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE