./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/num_conversion_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/num_conversion_1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:22:03,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:22:03,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:22:03,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:22:03,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:22:03,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:22:03,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:22:03,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:22:03,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:22:03,550 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:22:03,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:22:03,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:22:03,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:22:03,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:22:03,554 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:22:03,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:22:03,554 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:22:03,555 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:22:03,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:22:03,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:22:03,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:22:03,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:22:03,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:22:03,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:22:03,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:22:03,560 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:22:03,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:22:03,561 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:22:03,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:22:03,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:22:03,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:22:03,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:22:03,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:03,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:22:03,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:22:03,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:22:03,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:22:03,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:22:03,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:22:03,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:22:03,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:22:03,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:22:03,565 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 [2024-11-08 10:22:03,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:22:03,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:22:03,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:22:03,884 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:22:03,884 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:22:03,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_1.c [2024-11-08 10:22:05,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:22:05,509 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:22:05,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2024-11-08 10:22:05,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85642c02e/93c6820029e0418ca0bea3daff1d96ce/FLAGb1649daf0 [2024-11-08 10:22:05,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85642c02e/93c6820029e0418ca0bea3daff1d96ce [2024-11-08 10:22:05,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:22:05,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:22:05,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:22:05,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:22:05,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:22:05,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:05" (1/1) ... [2024-11-08 10:22:05,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@380f3ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:05, skipping insertion in model container [2024-11-08 10:22:05,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:05" (1/1) ... [2024-11-08 10:22:05,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:22:05,760 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c[673,686] [2024-11-08 10:22:05,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:22:05,793 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:22:05,806 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c[673,686] [2024-11-08 10:22:05,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:22:05,828 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:22:05,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:05 WrapperNode [2024-11-08 10:22:05,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:22:05,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:22:05,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:22:05,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:22:05,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:05" (1/1) ... [2024-11-08 10:22:05,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:05" (1/1) ... [2024-11-08 10:22:05,867 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2024-11-08 10:22:05,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:22:05,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:22:05,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:22:05,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:22:05,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:05" (1/1) ... [2024-11-08 10:22:05,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:05" (1/1) ... [2024-11-08 10:22:05,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:05" (1/1) ... [2024-11-08 10:22:05,893 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:22:05,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:05" (1/1) ... [2024-11-08 10:22:05,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:05" (1/1) ... [2024-11-08 10:22:05,897 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:05" (1/1) ... [2024-11-08 10:22:05,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:05" (1/1) ... [2024-11-08 10:22:05,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:05" (1/1) ... [2024-11-08 10:22:05,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:05" (1/1) ... [2024-11-08 10:22:05,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:22:05,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:22:05,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:22:05,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:22:05,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:05" (1/1) ... [2024-11-08 10:22:05,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:05,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:05,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:22:05,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:22:05,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:22:05,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:22:05,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:22:05,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:22:06,033 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:22:06,034 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:22:06,212 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-08 10:22:06,212 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:22:06,226 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:22:06,227 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:22:06,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:06 BoogieIcfgContainer [2024-11-08 10:22:06,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:22:06,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:22:06,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:22:06,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:22:06,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:22:05" (1/3) ... [2024-11-08 10:22:06,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36de5d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:06, skipping insertion in model container [2024-11-08 10:22:06,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:05" (2/3) ... [2024-11-08 10:22:06,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36de5d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:06, skipping insertion in model container [2024-11-08 10:22:06,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:06" (3/3) ... [2024-11-08 10:22:06,238 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2024-11-08 10:22:06,254 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:22:06,255 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:22:06,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:22:06,325 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;@3a8bbef0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:22:06,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:22:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:06,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 10:22:06,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:06,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 10:22:06,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:06,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:06,344 INFO L85 PathProgramCache]: Analyzing trace with hash 889661639, now seen corresponding path program 1 times [2024-11-08 10:22:06,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:06,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372240907] [2024-11-08 10:22:06,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:06,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:06,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:06,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:06,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372240907] [2024-11-08 10:22:06,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372240907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:06,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:06,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:06,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352164414] [2024-11-08 10:22:06,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:06,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:06,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:06,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:06,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:06,607 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:06,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:06,657 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2024-11-08 10:22:06,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:06,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 10:22:06,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:06,667 INFO L225 Difference]: With dead ends: 47 [2024-11-08 10:22:06,667 INFO L226 Difference]: Without dead ends: 25 [2024-11-08 10:22:06,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:06,671 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:06,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 38 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:06,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-08 10:22:06,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2024-11-08 10:22:06,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-08 10:22:06,701 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 6 [2024-11-08 10:22:06,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:06,701 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-08 10:22:06,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:06,702 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-08 10:22:06,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 10:22:06,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:06,704 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:06,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:22:06,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:06,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:06,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2083677087, now seen corresponding path program 1 times [2024-11-08 10:22:06,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:06,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909650297] [2024-11-08 10:22:06,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:06,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:06,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:06,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909650297] [2024-11-08 10:22:06,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909650297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:06,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:06,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:22:06,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735620293] [2024-11-08 10:22:06,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:06,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:22:06,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:06,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:22:06,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:22:06,903 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:06,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:06,933 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2024-11-08 10:22:06,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:22:06,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 13 [2024-11-08 10:22:06,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:06,937 INFO L225 Difference]: With dead ends: 34 [2024-11-08 10:22:06,937 INFO L226 Difference]: Without dead ends: 20 [2024-11-08 10:22:06,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:22:06,938 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:06,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:06,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-08 10:22:06,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-08 10:22:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-08 10:22:06,943 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2024-11-08 10:22:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:06,943 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-08 10:22:06,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-08 10:22:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 10:22:06,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:06,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:06,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:22:06,946 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:06,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:06,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2140935389, now seen corresponding path program 1 times [2024-11-08 10:22:06,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:06,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818753937] [2024-11-08 10:22:06,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:06,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:07,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:07,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818753937] [2024-11-08 10:22:07,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818753937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:07,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:07,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 10:22:07,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086571347] [2024-11-08 10:22:07,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:07,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 10:22:07,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:07,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 10:22:07,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:22:07,179 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:07,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:07,241 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2024-11-08 10:22:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 10:22:07,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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 13 [2024-11-08 10:22:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:07,244 INFO L225 Difference]: With dead ends: 43 [2024-11-08 10:22:07,244 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 10:22:07,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:22:07,246 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:07,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 36 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:07,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 10:22:07,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-11-08 10:22:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-08 10:22:07,255 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2024-11-08 10:22:07,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:07,255 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-08 10:22:07,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-08 10:22:07,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 10:22:07,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:07,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:07,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:22:07,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:07,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:07,259 INFO L85 PathProgramCache]: Analyzing trace with hash 391172444, now seen corresponding path program 1 times [2024-11-08 10:22:07,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:07,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7951452] [2024-11-08 10:22:07,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:07,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:07,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:07,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7951452] [2024-11-08 10:22:07,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7951452] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:07,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280974008] [2024-11-08 10:22:07,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:07,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:07,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:07,377 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:22:07,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 10:22:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:07,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 10:22:07,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:07,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:07,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280974008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:07,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:22:07,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2024-11-08 10:22:07,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200435979] [2024-11-08 10:22:07,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:07,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 10:22:07,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:07,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 10:22:07,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:22:07,549 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:07,587 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2024-11-08 10:22:07,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 10:22:07,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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 15 [2024-11-08 10:22:07,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:07,588 INFO L225 Difference]: With dead ends: 58 [2024-11-08 10:22:07,589 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 10:22:07,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:22:07,590 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:07,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 67 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:07,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 10:22:07,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2024-11-08 10:22:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-08 10:22:07,597 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 15 [2024-11-08 10:22:07,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:07,597 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-08 10:22:07,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-08 10:22:07,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 10:22:07,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:07,598 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:07,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 10:22:07,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:07,800 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:07,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:07,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1658280049, now seen corresponding path program 1 times [2024-11-08 10:22:07,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:07,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608485144] [2024-11-08 10:22:07,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:07,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:07,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:07,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:07,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608485144] [2024-11-08 10:22:07,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608485144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:07,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484588103] [2024-11-08 10:22:07,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:07,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:07,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:07,967 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:22:07,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 10:22:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:08,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 10:22:08,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:08,131 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:08,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:08,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484588103] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:08,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:22:08,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2024-11-08 10:22:08,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034828462] [2024-11-08 10:22:08,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:08,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 10:22:08,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:08,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 10:22:08,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-08 10:22:08,293 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:08,498 INFO L93 Difference]: Finished difference Result 110 states and 140 transitions. [2024-11-08 10:22:08,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 10:22:08,499 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 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 23 [2024-11-08 10:22:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:08,500 INFO L225 Difference]: With dead ends: 110 [2024-11-08 10:22:08,501 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 10:22:08,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=208, Unknown=0, NotChecked=0, Total=342 [2024-11-08 10:22:08,502 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 126 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:08,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 151 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:08,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 10:22:08,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2024-11-08 10:22:08,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 75 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:08,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2024-11-08 10:22:08,517 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 95 transitions. Word has length 23 [2024-11-08 10:22:08,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:08,518 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 95 transitions. [2024-11-08 10:22:08,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 95 transitions. [2024-11-08 10:22:08,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 10:22:08,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:08,521 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:08,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 10:22:08,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:08,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:08,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:08,723 INFO L85 PathProgramCache]: Analyzing trace with hash -578870693, now seen corresponding path program 2 times [2024-11-08 10:22:08,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:08,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387395923] [2024-11-08 10:22:08,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:08,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:09,026 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:09,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:09,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387395923] [2024-11-08 10:22:09,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387395923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:09,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565806930] [2024-11-08 10:22:09,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 10:22:09,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:09,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:09,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:22:09,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 10:22:09,195 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 10:22:09,196 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:22:09,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 10:22:09,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:09,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:09,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565806930] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:09,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:22:09,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2024-11-08 10:22:09,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019690406] [2024-11-08 10:22:09,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:09,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 10:22:09,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:09,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 10:22:09,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2024-11-08 10:22:09,921 INFO L87 Difference]: Start difference. First operand 76 states and 95 transitions. Second operand has 25 states, 25 states have (on average 6.2) internal successors, (155), 25 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:10,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:10,509 INFO L93 Difference]: Finished difference Result 251 states and 330 transitions. [2024-11-08 10:22:10,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 10:22:10,510 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.2) internal successors, (155), 25 states have internal predecessors, (155), 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 55 [2024-11-08 10:22:10,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:10,511 INFO L225 Difference]: With dead ends: 251 [2024-11-08 10:22:10,511 INFO L226 Difference]: Without dead ends: 179 [2024-11-08 10:22:10,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=303, Invalid=689, Unknown=0, NotChecked=0, Total=992 [2024-11-08 10:22:10,514 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 400 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:10,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 591 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:22:10,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-08 10:22:10,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 172. [2024-11-08 10:22:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.286549707602339) internal successors, (220), 171 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 220 transitions. [2024-11-08 10:22:10,540 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 220 transitions. Word has length 55 [2024-11-08 10:22:10,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:10,541 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 220 transitions. [2024-11-08 10:22:10,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.2) internal successors, (155), 25 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:10,542 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 220 transitions. [2024-11-08 10:22:10,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 10:22:10,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:10,545 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:10,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 10:22:10,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:10,749 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:10,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:10,749 INFO L85 PathProgramCache]: Analyzing trace with hash 858721729, now seen corresponding path program 3 times [2024-11-08 10:22:10,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:10,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988913069] [2024-11-08 10:22:10,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:10,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 10:22:10,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 10:22:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 10:22:10,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 10:22:10,819 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 10:22:10,820 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:22:10,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:22:10,824 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-11-08 10:22:10,864 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:22:10,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:22:10 BoogieIcfgContainer [2024-11-08 10:22:10,867 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:22:10,867 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:22:10,868 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:22:10,868 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:22:10,868 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:06" (3/4) ... [2024-11-08 10:22:10,871 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 10:22:10,872 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:22:10,872 INFO L158 Benchmark]: Toolchain (without parser) took 5328.07ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 110.7MB in the beginning and 122.3MB in the end (delta: -11.7MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-08 10:22:10,872 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 113.2MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:22:10,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.26ms. Allocated memory is still 151.0MB. Free memory was 110.0MB in the beginning and 98.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 10:22:10,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.32ms. Allocated memory is still 151.0MB. Free memory was 98.1MB in the beginning and 96.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 10:22:10,873 INFO L158 Benchmark]: Boogie Preprocessor took 35.87ms. Allocated memory is still 151.0MB. Free memory was 96.0MB in the beginning and 93.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 10:22:10,873 INFO L158 Benchmark]: RCFGBuilder took 323.54ms. Allocated memory is still 151.0MB. Free memory was 93.9MB in the beginning and 82.0MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 10:22:10,874 INFO L158 Benchmark]: TraceAbstraction took 4636.34ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 81.3MB in the beginning and 122.3MB in the end (delta: -41.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:22:10,874 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 182.5MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:22:10,876 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.20ms. Allocated memory is still 113.2MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.26ms. Allocated memory is still 151.0MB. Free memory was 110.0MB in the beginning and 98.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.32ms. Allocated memory is still 151.0MB. Free memory was 98.1MB in the beginning and 96.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.87ms. Allocated memory is still 151.0MB. Free memory was 96.0MB in the beginning and 93.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 323.54ms. Allocated memory is still 151.0MB. Free memory was 93.9MB in the beginning and 82.0MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4636.34ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 81.3MB in the beginning and 122.3MB in the end (delta: -41.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 182.5MB. Free memory is still 122.3MB. 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: 16]: 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 shiftLeft at line 32, overapproximation of bitwiseAnd at line 33. Possible FailurePath: [L24] unsigned char x; [L25] unsigned char y; [L26] unsigned char c; [L28] x = 37 [L29] y = 0 [L30] c = 0 VAL [c=0, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 VAL [c=0, x=37, y=0] [L32] EXPR ((unsigned char)1) << c VAL [c=0, x=37, y=0] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=0, i=1, x=37, y=0] [L33] unsigned char bit = x & i; [L34] COND TRUE bit != (unsigned char)0 [L35] y = y + i VAL [c=0, x=37, y=1] [L37] c = c + ((unsigned char)1) [L31] COND TRUE c < (unsigned char)8 VAL [c=1, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=1, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=1, i=256, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE !(bit != (unsigned char)0) VAL [c=1, i=256, x=37, y=1] [L37] c = c + ((unsigned char)1) [L31] COND TRUE c < (unsigned char)8 VAL [c=2, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=2, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=2, i=256, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE !(bit != (unsigned char)0) VAL [c=2, i=256, x=37, y=1] [L37] c = c + ((unsigned char)1) [L31] COND TRUE c < (unsigned char)8 VAL [c=3, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=3, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=3, i=256, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE !(bit != (unsigned char)0) VAL [c=3, i=256, x=37, y=1] [L37] c = c + ((unsigned char)1) [L31] COND TRUE c < (unsigned char)8 VAL [c=4, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=4, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=4, i=256, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE !(bit != (unsigned char)0) VAL [c=4, i=256, x=37, y=1] [L37] c = c + ((unsigned char)1) [L31] COND TRUE c < (unsigned char)8 VAL [c=5, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=5, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=5, i=256, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE !(bit != (unsigned char)0) VAL [c=5, i=256, x=37, y=1] [L37] c = c + ((unsigned char)1) [L31] COND TRUE c < (unsigned char)8 VAL [c=6, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=6, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=6, i=256, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE !(bit != (unsigned char)0) VAL [c=6, i=256, x=37, y=1] [L37] c = c + ((unsigned char)1) [L31] COND TRUE c < (unsigned char)8 VAL [c=7, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=7, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=7, i=256, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE !(bit != (unsigned char)0) VAL [c=7, i=256, x=37, y=1] [L37] c = c + ((unsigned char)1) [L31] COND FALSE !(c < (unsigned char)8) VAL [x=37, y=1] [L39] CALL __VERIFIER_assert(x == y) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 7, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 570 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 570 mSDsluCounter, 930 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 757 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 397 IncrementalHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 173 mSDtfsCounter, 397 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=6, InterpolantAutomatonStates: 50, 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, 6 MinimizatonAttempts, 37 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 1691 SizeOfPredicates, 5 NumberOfNonLiveVariables, 252 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 31/394 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 10:22:10,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/num_conversion_1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:22:13,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:22:13,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 10:22:13,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:22:13,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:22:13,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:22:13,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:22:13,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:22:13,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:22:13,285 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:22:13,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:22:13,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:22:13,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:22:13,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:22:13,288 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:22:13,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:22:13,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:22:13,289 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:22:13,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:22:13,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:22:13,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:22:13,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:22:13,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:22:13,291 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 10:22:13,292 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 10:22:13,292 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:22:13,292 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 10:22:13,292 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:22:13,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:22:13,293 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:22:13,293 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:22:13,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:22:13,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:22:13,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:22:13,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:13,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:22:13,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:22:13,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:22:13,296 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 10:22:13,296 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 10:22:13,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:22:13,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:22:13,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:22:13,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:22:13,298 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 [2024-11-08 10:22:13,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:22:13,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:22:13,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:22:13,641 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:22:13,641 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:22:13,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_1.c [2024-11-08 10:22:15,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:22:15,362 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:22:15,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2024-11-08 10:22:15,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7403ac3d8/43ccea1dd4c940e1b18202228d7090fb/FLAGc7418949b [2024-11-08 10:22:15,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7403ac3d8/43ccea1dd4c940e1b18202228d7090fb [2024-11-08 10:22:15,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:22:15,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:22:15,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:22:15,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:22:15,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:22:15,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:15" (1/1) ... [2024-11-08 10:22:15,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@736c1380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:15, skipping insertion in model container [2024-11-08 10:22:15,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:15" (1/1) ... [2024-11-08 10:22:15,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:22:15,957 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c[673,686] [2024-11-08 10:22:15,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:22:15,990 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:22:16,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c[673,686] [2024-11-08 10:22:16,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:22:16,026 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:22:16,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:16 WrapperNode [2024-11-08 10:22:16,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:22:16,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:22:16,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:22:16,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:22:16,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:16" (1/1) ... [2024-11-08 10:22:16,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:16" (1/1) ... [2024-11-08 10:22:16,059 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2024-11-08 10:22:16,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:22:16,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:22:16,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:22:16,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:22:16,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:16" (1/1) ... [2024-11-08 10:22:16,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:16" (1/1) ... [2024-11-08 10:22:16,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:16" (1/1) ... [2024-11-08 10:22:16,083 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:22:16,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:16" (1/1) ... [2024-11-08 10:22:16,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:16" (1/1) ... [2024-11-08 10:22:16,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:16" (1/1) ... [2024-11-08 10:22:16,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:16" (1/1) ... [2024-11-08 10:22:16,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:16" (1/1) ... [2024-11-08 10:22:16,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:16" (1/1) ... [2024-11-08 10:22:16,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:22:16,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:22:16,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:22:16,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:22:16,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:16" (1/1) ... [2024-11-08 10:22:16,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:16,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:16,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:22:16,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:22:16,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:22:16,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:22:16,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:22:16,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 10:22:16,250 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:22:16,252 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:22:16,381 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-08 10:22:16,381 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:22:16,392 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:22:16,393 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:22:16,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:16 BoogieIcfgContainer [2024-11-08 10:22:16,393 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:22:16,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:22:16,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:22:16,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:22:16,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:22:15" (1/3) ... [2024-11-08 10:22:16,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48779eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:16, skipping insertion in model container [2024-11-08 10:22:16,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:16" (2/3) ... [2024-11-08 10:22:16,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48779eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:16, skipping insertion in model container [2024-11-08 10:22:16,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:16" (3/3) ... [2024-11-08 10:22:16,403 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2024-11-08 10:22:16,419 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:22:16,419 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:22:16,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:22:16,482 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;@708740ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:22:16,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:22:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:16,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 10:22:16,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:16,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 10:22:16,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:16,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2024-11-08 10:22:16,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:16,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299746050] [2024-11-08 10:22:16,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:16,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:16,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:16,512 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:16,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 10:22:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:16,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 10:22:16,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:16,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:16,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:16,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299746050] [2024-11-08 10:22:16,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299746050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:16,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:16,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:22:16,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933537117] [2024-11-08 10:22:16,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:16,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 10:22:16,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:16,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 10:22:16,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 10:22:16,636 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:16,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:16,651 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-08 10:22:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 10:22:16,653 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 10:22:16,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:16,660 INFO L225 Difference]: With dead ends: 21 [2024-11-08 10:22:16,661 INFO L226 Difference]: Without dead ends: 9 [2024-11-08 10:22:16,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 10:22:16,669 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:16,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-08 10:22:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-08 10:22:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-08 10:22:16,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2024-11-08 10:22:16,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:16,699 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-08 10:22:16,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2024-11-08 10:22:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 10:22:16,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:16,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 10:22:16,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 10:22:16,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:16,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:16,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:16,902 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2024-11-08 10:22:16,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:16,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575765038] [2024-11-08 10:22:16,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:16,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:16,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:16,905 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:16,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 10:22:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:16,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:22:16,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:16,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:16,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:16,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575765038] [2024-11-08 10:22:16,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575765038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:16,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:16,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:16,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426380407] [2024-11-08 10:22:16,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:16,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:16,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:16,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:16,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:16,985 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:17,009 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-11-08 10:22:17,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:17,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 10:22:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:17,011 INFO L225 Difference]: With dead ends: 16 [2024-11-08 10:22:17,011 INFO L226 Difference]: Without dead ends: 12 [2024-11-08 10:22:17,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:17,014 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:17,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-08 10:22:17,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2024-11-08 10:22:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-08 10:22:17,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2024-11-08 10:22:17,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2024-11-08 10:22:17,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:17,020 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-11-08 10:22:17,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2024-11-08 10:22:17,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 10:22:17,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:17,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:17,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 10:22:17,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:17,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:17,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:17,223 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2024-11-08 10:22:17,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:17,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378408376] [2024-11-08 10:22:17,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:17,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:17,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:17,226 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:17,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 10:22:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:17,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 10:22:17,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:17,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:17,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:17,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:17,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378408376] [2024-11-08 10:22:17,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378408376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:17,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:17,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:22:17,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794079594] [2024-11-08 10:22:17,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:17,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:22:17,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:17,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:22:17,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:22:17,355 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:17,403 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2024-11-08 10:22:17,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:22:17,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-08 10:22:17,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:17,405 INFO L225 Difference]: With dead ends: 19 [2024-11-08 10:22:17,405 INFO L226 Difference]: Without dead ends: 12 [2024-11-08 10:22:17,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:22:17,407 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:17,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:17,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-08 10:22:17,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-11-08 10:22:17,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-11-08 10:22:17,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2024-11-08 10:22:17,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:17,415 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-08 10:22:17,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2024-11-08 10:22:17,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 10:22:17,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:17,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:17,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 10:22:17,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:17,619 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:17,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:17,619 INFO L85 PathProgramCache]: Analyzing trace with hash 584467323, now seen corresponding path program 1 times [2024-11-08 10:22:17,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:17,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28565694] [2024-11-08 10:22:17,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:17,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:17,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:17,624 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:17,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 10:22:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:17,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:22:17,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:17,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:17,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:17,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28565694] [2024-11-08 10:22:17,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28565694] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:17,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:22:17,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-08 10:22:17,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855588483] [2024-11-08 10:22:17,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:17,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:22:17,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:17,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:22:17,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:22:17,739 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:17,791 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-11-08 10:22:17,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:22:17,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) Word has length 9 [2024-11-08 10:22:17,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:17,792 INFO L225 Difference]: With dead ends: 23 [2024-11-08 10:22:17,792 INFO L226 Difference]: Without dead ends: 19 [2024-11-08 10:22:17,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:22:17,794 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:17,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 23 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:17,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-08 10:22:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-08 10:22:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-08 10:22:17,801 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2024-11-08 10:22:17,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:17,801 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-08 10:22:17,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,801 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-08 10:22:17,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 10:22:17,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:17,802 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:17,804 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 (5)] Ended with exit code 0 [2024-11-08 10:22:18,002 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-11-08 10:22:18,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:18,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:18,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1843204080, now seen corresponding path program 1 times [2024-11-08 10:22:18,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:18,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767920287] [2024-11-08 10:22:18,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:18,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:18,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:18,008 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:18,010 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 (6)] Waiting until timeout for monitored process [2024-11-08 10:22:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:18,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 10:22:18,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 10:22:18,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 10:22:18,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:18,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767920287] [2024-11-08 10:22:18,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767920287] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:18,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:22:18,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-08 10:22:18,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816528460] [2024-11-08 10:22:18,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:18,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 10:22:18,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:18,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 10:22:18,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-08 10:22:18,249 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:18,387 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-08 10:22:18,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 10:22:18,388 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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 18 [2024-11-08 10:22:18,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:18,388 INFO L225 Difference]: With dead ends: 36 [2024-11-08 10:22:18,388 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 10:22:18,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-08 10:22:18,390 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:18,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 36 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:18,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 10:22:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-08 10:22:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 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-11-08 10:22:18,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-08 10:22:18,399 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2024-11-08 10:22:18,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:18,399 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-08 10:22:18,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,400 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-08 10:22:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 10:22:18,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:18,401 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:18,407 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 (6)] Ended with exit code 0 [2024-11-08 10:22:18,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:18,602 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:18,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:18,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1771704846, now seen corresponding path program 2 times [2024-11-08 10:22:18,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:18,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117294245] [2024-11-08 10:22:18,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 10:22:18,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:18,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:18,604 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:18,606 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 (7)] Waiting until timeout for monitored process [2024-11-08 10:22:18,639 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 10:22:18,639 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:22:18,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 10:22:18,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:18,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:18,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:18,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117294245] [2024-11-08 10:22:18,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117294245] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:18,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:22:18,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-08 10:22:18,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791499924] [2024-11-08 10:22:18,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:18,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 10:22:18,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:18,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 10:22:18,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-08 10:22:18,794 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:18,885 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2024-11-08 10:22:18,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 10:22:18,886 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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 18 [2024-11-08 10:22:18,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:18,887 INFO L225 Difference]: With dead ends: 35 [2024-11-08 10:22:18,887 INFO L226 Difference]: Without dead ends: 31 [2024-11-08 10:22:18,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-08 10:22:18,888 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:18,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 66 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-08 10:22:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-08 10:22:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-11-08 10:22:18,894 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2024-11-08 10:22:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:18,894 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-11-08 10:22:18,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-11-08 10:22:18,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 10:22:18,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:18,896 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:18,899 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 (7)] Ended with exit code 0 [2024-11-08 10:22:19,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:19,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:19,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:19,097 INFO L85 PathProgramCache]: Analyzing trace with hash -29656432, now seen corresponding path program 3 times [2024-11-08 10:22:19,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:19,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621199466] [2024-11-08 10:22:19,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 10:22:19,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:19,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:19,101 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:19,104 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 (8)] Waiting until timeout for monitored process [2024-11-08 10:22:19,144 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-08 10:22:19,144 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:22:19,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 10:22:19,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 83 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 10:22:19,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 10:22:25,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:25,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621199466] [2024-11-08 10:22:25,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621199466] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:25,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:22:25,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2024-11-08 10:22:25,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089299323] [2024-11-08 10:22:25,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:25,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 10:22:25,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:25,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 10:22:25,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2024-11-08 10:22:25,451 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:27,506 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2024-11-08 10:22:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-08 10:22:27,507 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 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-11-08 10:22:27,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:27,508 INFO L225 Difference]: With dead ends: 75 [2024-11-08 10:22:27,509 INFO L226 Difference]: Without dead ends: 71 [2024-11-08 10:22:27,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=325, Invalid=1931, Unknown=0, NotChecked=0, Total=2256 [2024-11-08 10:22:27,511 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:27,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 139 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:22:27,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-08 10:22:27,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2024-11-08 10:22:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2024-11-08 10:22:27,525 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 30 [2024-11-08 10:22:27,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:27,525 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2024-11-08 10:22:27,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2024-11-08 10:22:27,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 10:22:27,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:27,527 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:27,530 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 (8)] Ended with exit code 0 [2024-11-08 10:22:27,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:27,730 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:27,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:27,730 INFO L85 PathProgramCache]: Analyzing trace with hash -86914734, now seen corresponding path program 4 times [2024-11-08 10:22:27,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:27,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291740226] [2024-11-08 10:22:27,731 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 10:22:27,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:27,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:27,733 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:27,734 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 (9)] Waiting until timeout for monitored process [2024-11-08 10:22:27,769 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 10:22:27,769 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:22:27,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 10:22:27,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 85 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:28,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:29,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:29,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291740226] [2024-11-08 10:22:29,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291740226] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:29,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:22:29,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 30 [2024-11-08 10:22:29,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941530828] [2024-11-08 10:22:29,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:29,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-08 10:22:29,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:29,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 10:22:29,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=575, Unknown=0, NotChecked=0, Total=870 [2024-11-08 10:22:29,235 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 30 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 30 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:30,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:30,040 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2024-11-08 10:22:30,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 10:22:30,041 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 30 states have internal predecessors, (56), 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-11-08 10:22:30,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:30,042 INFO L225 Difference]: With dead ends: 63 [2024-11-08 10:22:30,042 INFO L226 Difference]: Without dead ends: 56 [2024-11-08 10:22:30,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=701, Invalid=1279, Unknown=0, NotChecked=0, Total=1980 [2024-11-08 10:22:30,044 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:30,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 41 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:22:30,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-08 10:22:30,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2024-11-08 10:22:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2024-11-08 10:22:30,060 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 30 [2024-11-08 10:22:30,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:30,061 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-11-08 10:22:30,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 30 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:30,063 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-11-08 10:22:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 10:22:30,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:30,063 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:30,068 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 (9)] Ended with exit code 0 [2024-11-08 10:22:30,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:30,264 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:30,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:30,265 INFO L85 PathProgramCache]: Analyzing trace with hash -709714802, now seen corresponding path program 5 times [2024-11-08 10:22:30,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:30,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786220468] [2024-11-08 10:22:30,265 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 10:22:30,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:30,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:30,267 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:30,269 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 (10)] Waiting until timeout for monitored process [2024-11-08 10:22:30,302 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-11-08 10:22:30,302 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:22:30,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 10:22:30,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 10:22:30,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 35 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:31,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:31,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786220468] [2024-11-08 10:22:31,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1786220468] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:31,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:22:31,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19] total 28 [2024-11-08 10:22:31,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513894555] [2024-11-08 10:22:31,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:31,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-08 10:22:31,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:31,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-08 10:22:31,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2024-11-08 10:22:31,420 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:31,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:31,666 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2024-11-08 10:22:31,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 10:22:31,667 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 28 states have internal predecessors, (52), 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-11-08 10:22:31,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:31,667 INFO L225 Difference]: With dead ends: 51 [2024-11-08 10:22:31,668 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:22:31,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2024-11-08 10:22:31,669 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:31,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 34 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:22:31,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:22:31,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:22:31,670 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-11-08 10:22:31,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:22:31,670 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2024-11-08 10:22:31,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:31,670 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:22:31,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:22:31,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:22:31,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:22:31,680 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 (10)] Ended with exit code 0 [2024-11-08 10:22:31,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:31,877 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2024-11-08 10:22:31,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:22:32,233 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:22:32,264 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 10:22:32,269 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 10:22:32,269 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 10:22:32,271 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 10:22:32,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:22:32 BoogieIcfgContainer [2024-11-08 10:22:32,278 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:22:32,279 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:22:32,282 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:22:32,282 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:22:32,283 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:16" (3/4) ... [2024-11-08 10:22:32,286 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:22:32,301 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-08 10:22:32,322 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:22:32,326 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:22:32,326 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:22:32,427 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:22:32,428 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:22:32,428 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:22:32,428 INFO L158 Benchmark]: Toolchain (without parser) took 16694.44ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 32.0MB in the beginning and 68.0MB in the end (delta: -36.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:22:32,429 INFO L158 Benchmark]: CDTParser took 1.08ms. Allocated memory is still 46.1MB. Free memory is still 24.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:22:32,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.90ms. Allocated memory is still 65.0MB. Free memory was 31.8MB in the beginning and 35.3MB in the end (delta: -3.5MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-11-08 10:22:32,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.72ms. Allocated memory is still 65.0MB. Free memory was 35.3MB in the beginning and 33.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 10:22:32,429 INFO L158 Benchmark]: Boogie Preprocessor took 39.53ms. Allocated memory is still 65.0MB. Free memory was 33.8MB in the beginning and 32.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 10:22:32,430 INFO L158 Benchmark]: RCFGBuilder took 292.79ms. Allocated memory is still 65.0MB. Free memory was 32.0MB in the beginning and 39.6MB in the end (delta: -7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 10:22:32,430 INFO L158 Benchmark]: TraceAbstraction took 15883.29ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 39.1MB in the beginning and 72.2MB in the end (delta: -33.2MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2024-11-08 10:22:32,431 INFO L158 Benchmark]: Witness Printer took 149.11ms. Allocated memory is still 96.5MB. Free memory was 72.2MB in the beginning and 68.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 10:22:32,432 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.08ms. Allocated memory is still 46.1MB. Free memory is still 24.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.90ms. Allocated memory is still 65.0MB. Free memory was 31.8MB in the beginning and 35.3MB in the end (delta: -3.5MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.72ms. Allocated memory is still 65.0MB. Free memory was 35.3MB in the beginning and 33.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.53ms. Allocated memory is still 65.0MB. Free memory was 33.8MB in the beginning and 32.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 292.79ms. Allocated memory is still 65.0MB. Free memory was 32.0MB in the beginning and 39.6MB in the end (delta: -7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15883.29ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 39.1MB in the beginning and 72.2MB in the end (delta: -33.2MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. * Witness Printer took 149.11ms. Allocated memory is still 96.5MB. Free memory was 72.2MB in the beginning and 68.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 16]: 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, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.4s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 384 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 988 IncrementalHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 79 mSDtfsCounter, 988 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=7, InterpolantAutomatonStates: 109, 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, 9 MinimizatonAttempts, 33 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 276 ConstructedInterpolants, 45 QuantifiedInterpolants, 5495 SizeOfPredicates, 14 NumberOfNonLiveVariables, 365 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 202/643 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: 31]: Loop Invariant Derived loop invariant: ((((((((((c < 8) && (x == 37)) || (((y == 1) && (x == 37)) && (c == 1))) || (((c == 3) && (x == 37)) && (y == 5))) || (((x == 37) && (c == 4)) && (y == 5))) || (((c == 5) && (x == 37)) && (y == 5))) || (((y == 0) && (c == 0)) && (x == 37))) || (((y == 1) && (c == 2)) && (x == 37))) || ((x == 37) && !(c < 8))) || ((x == 37) && (c == 6))) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:22:32,473 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