./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 3061b6dc 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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 09:32:22,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 09:32:22,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 09:32:22,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 09:32:22,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 09:32:22,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 09:32:22,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 09:32:22,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 09:32:22,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 09:32:22,639 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 09:32:22,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 09:32:22,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 09:32:22,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 09:32:22,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 09:32:22,640 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 09:32:22,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 09:32:22,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 09:32:22,645 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 09:32:22,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 09:32:22,645 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 09:32:22,645 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 09:32:22,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 09:32:22,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 09:32:22,647 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 09:32:22,647 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 09:32:22,647 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 09:32:22,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 09:32:22,647 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 09:32:22,647 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 09:32:22,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 09:32:22,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 09:32:22,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 09:32:22,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:32:22,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 09:32:22,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 09:32:22,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 09:32:22,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 09:32:22,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 09:32:22,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 09:32:22,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 09:32:22,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 09:32:22,650 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 09:32:22,650 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-18 09:32:22,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 09:32:22,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 09:32:22,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 09:32:22,851 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 09:32:22,852 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 09:32:22,853 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-18 09:32:24,023 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 09:32:24,173 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 09:32:24,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2024-11-18 09:32:24,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cee5e480/208387ecb8e04168b8dc974a5be8f4d1/FLAGa4746431e [2024-11-18 09:32:24,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cee5e480/208387ecb8e04168b8dc974a5be8f4d1 [2024-11-18 09:32:24,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 09:32:24,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 09:32:24,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 09:32:24,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 09:32:24,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 09:32:24,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:32:24" (1/1) ... [2024-11-18 09:32:24,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@627e992f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:24, skipping insertion in model container [2024-11-18 09:32:24,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:32:24" (1/1) ... [2024-11-18 09:32:24,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 09:32:24,739 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-18 09:32:24,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:32:24,756 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 09:32:24,764 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-18 09:32:24,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:32:24,778 INFO L204 MainTranslator]: Completed translation [2024-11-18 09:32:24,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:24 WrapperNode [2024-11-18 09:32:24,778 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 09:32:24,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 09:32:24,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 09:32:24,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 09:32:24,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:24" (1/1) ... [2024-11-18 09:32:24,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:24" (1/1) ... [2024-11-18 09:32:24,807 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2024-11-18 09:32:24,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 09:32:24,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 09:32:24,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 09:32:24,809 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 09:32:24,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:24" (1/1) ... [2024-11-18 09:32:24,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:24" (1/1) ... [2024-11-18 09:32:24,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:24" (1/1) ... [2024-11-18 09:32:24,826 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-18 09:32:24,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:24" (1/1) ... [2024-11-18 09:32:24,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:24" (1/1) ... [2024-11-18 09:32:24,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:24" (1/1) ... [2024-11-18 09:32:24,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:24" (1/1) ... [2024-11-18 09:32:24,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:24" (1/1) ... [2024-11-18 09:32:24,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:24" (1/1) ... [2024-11-18 09:32:24,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 09:32:24,834 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 09:32:24,834 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 09:32:24,834 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 09:32:24,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:24" (1/1) ... [2024-11-18 09:32:24,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:32:24,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:24,861 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-18 09:32:24,863 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-18 09:32:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 09:32:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 09:32:24,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 09:32:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 09:32:24,953 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 09:32:24,955 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 09:32:25,080 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-18 09:32:25,080 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 09:32:25,092 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 09:32:25,092 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 09:32:25,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:32:25 BoogieIcfgContainer [2024-11-18 09:32:25,093 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 09:32:25,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 09:32:25,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 09:32:25,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 09:32:25,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:32:24" (1/3) ... [2024-11-18 09:32:25,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516598c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:32:25, skipping insertion in model container [2024-11-18 09:32:25,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:24" (2/3) ... [2024-11-18 09:32:25,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516598c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:32:25, skipping insertion in model container [2024-11-18 09:32:25,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:32:25" (3/3) ... [2024-11-18 09:32:25,100 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2024-11-18 09:32:25,133 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 09:32:25,134 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 09:32:25,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 09:32:25,235 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;@71464d94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 09:32:25,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 09:32:25,239 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-18 09:32:25,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-18 09:32:25,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:25,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-18 09:32:25,245 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:25,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:25,250 INFO L85 PathProgramCache]: Analyzing trace with hash 889661639, now seen corresponding path program 1 times [2024-11-18 09:32:25,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:25,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487653265] [2024-11-18 09:32:25,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:25,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:25,417 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-18 09:32:25,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:25,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487653265] [2024-11-18 09:32:25,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487653265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:25,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:25,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:32:25,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987692030] [2024-11-18 09:32:25,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:25,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:32:25,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:25,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:32:25,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:32:25,446 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-18 09:32:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:25,492 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2024-11-18 09:32:25,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:32:25,494 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-18 09:32:25,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:25,500 INFO L225 Difference]: With dead ends: 47 [2024-11-18 09:32:25,500 INFO L226 Difference]: Without dead ends: 25 [2024-11-18 09:32:25,502 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-18 09:32:25,507 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-18 09:32:25,507 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-18 09:32:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-18 09:32:25,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2024-11-18 09:32:25,531 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-18 09:32:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-18 09:32:25,533 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 6 [2024-11-18 09:32:25,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:25,534 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-18 09:32:25,534 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-18 09:32:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-18 09:32:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-18 09:32:25,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:25,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:25,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 09:32:25,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:25,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:25,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2083677087, now seen corresponding path program 1 times [2024-11-18 09:32:25,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:25,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082686631] [2024-11-18 09:32:25,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:25,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:25,706 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-18 09:32:25,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:25,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082686631] [2024-11-18 09:32:25,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082686631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:25,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:25,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:32:25,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034723431] [2024-11-18 09:32:25,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:25,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:32:25,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:25,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:32:25,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:32:25,709 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-18 09:32:25,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:25,730 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2024-11-18 09:32:25,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:32:25,731 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-18 09:32:25,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:25,731 INFO L225 Difference]: With dead ends: 34 [2024-11-18 09:32:25,731 INFO L226 Difference]: Without dead ends: 20 [2024-11-18 09:32:25,732 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-18 09:32:25,733 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-18 09:32:25,734 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-18 09:32:25,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-18 09:32:25,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-18 09:32:25,738 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-18 09:32:25,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-18 09:32:25,740 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2024-11-18 09:32:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:25,740 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-18 09:32:25,740 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-18 09:32:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-18 09:32:25,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-18 09:32:25,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:25,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:25,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 09:32:25,741 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:25,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:25,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2140935389, now seen corresponding path program 1 times [2024-11-18 09:32:25,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:25,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270951258] [2024-11-18 09:32:25,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:25,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:25,931 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-18 09:32:25,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:25,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270951258] [2024-11-18 09:32:25,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270951258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:25,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:25,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:32:25,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252198723] [2024-11-18 09:32:25,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:25,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:32:25,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:25,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:32:25,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:32:25,935 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-18 09:32:25,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:25,978 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2024-11-18 09:32:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:32:25,978 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-18 09:32:25,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:25,980 INFO L225 Difference]: With dead ends: 43 [2024-11-18 09:32:25,981 INFO L226 Difference]: Without dead ends: 27 [2024-11-18 09:32:25,982 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-18 09:32:25,982 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.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:25,983 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.0s Time] [2024-11-18 09:32:25,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-18 09:32:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-11-18 09:32:25,986 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-18 09:32:25,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-18 09:32:25,987 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2024-11-18 09:32:25,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:25,987 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-18 09:32:25,988 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-18 09:32:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-18 09:32:25,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 09:32:25,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:25,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:25,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 09:32:25,989 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:25,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash 391172444, now seen corresponding path program 1 times [2024-11-18 09:32:25,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:25,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700036383] [2024-11-18 09:32:25,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:25,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:26,069 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-18 09:32:26,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:26,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700036383] [2024-11-18 09:32:26,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700036383] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:26,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528076317] [2024-11-18 09:32:26,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:26,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:26,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:26,072 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-18 09:32:26,074 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-18 09:32:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:26,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 09:32:26,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:26,208 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-18 09:32:26,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:32:26,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528076317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:26,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:32:26,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2024-11-18 09:32:26,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982244819] [2024-11-18 09:32:26,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:26,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:32:26,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:26,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:32:26,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:32:26,212 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-18 09:32:26,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:26,240 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2024-11-18 09:32:26,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:32:26,242 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-18 09:32:26,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:26,243 INFO L225 Difference]: With dead ends: 58 [2024-11-18 09:32:26,243 INFO L226 Difference]: Without dead ends: 39 [2024-11-18 09:32:26,244 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-18 09:32:26,244 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-18 09:32:26,245 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-18 09:32:26,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-18 09:32:26,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2024-11-18 09:32:26,248 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-18 09:32:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-18 09:32:26,249 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 15 [2024-11-18 09:32:26,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:26,249 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-18 09:32:26,249 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-18 09:32:26,249 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-18 09:32:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-18 09:32:26,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:26,250 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-18 09:32:26,262 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-18 09:32:26,450 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-18 09:32:26,451 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:26,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:26,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1658280049, now seen corresponding path program 1 times [2024-11-18 09:32:26,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:26,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900274546] [2024-11-18 09:32:26,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:26,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:26,567 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-18 09:32:26,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:26,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900274546] [2024-11-18 09:32:26,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900274546] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:26,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093620771] [2024-11-18 09:32:26,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:26,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:26,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:26,571 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-18 09:32:26,572 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-18 09:32:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:26,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-18 09:32:26,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:26,698 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-18 09:32:26,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:26,816 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-18 09:32:26,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093620771] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:26,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:32:26,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2024-11-18 09:32:26,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047251586] [2024-11-18 09:32:26,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:26,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-18 09:32:26,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:26,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-18 09:32:26,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-18 09:32:26,818 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-18 09:32:26,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:26,961 INFO L93 Difference]: Finished difference Result 110 states and 140 transitions. [2024-11-18 09:32:26,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 09:32:26,961 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-18 09:32:26,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:26,962 INFO L225 Difference]: With dead ends: 110 [2024-11-18 09:32:26,962 INFO L226 Difference]: Without dead ends: 85 [2024-11-18 09:32:26,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=208, Unknown=0, NotChecked=0, Total=342 [2024-11-18 09:32:26,963 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-18 09:32:26,963 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-18 09:32:26,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-18 09:32:26,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2024-11-18 09:32:26,968 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-18 09:32:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2024-11-18 09:32:26,969 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 95 transitions. Word has length 23 [2024-11-18 09:32:26,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:26,970 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 95 transitions. [2024-11-18 09:32:26,970 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-18 09:32:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 95 transitions. [2024-11-18 09:32:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-18 09:32:26,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:26,971 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-18 09:32:26,984 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-18 09:32:27,175 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-18 09:32:27,176 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:27,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:27,176 INFO L85 PathProgramCache]: Analyzing trace with hash -578870693, now seen corresponding path program 2 times [2024-11-18 09:32:27,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:27,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163759036] [2024-11-18 09:32:27,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:32:27,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:27,204 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:32:27,204 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:32:27,387 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-18 09:32:27,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:27,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163759036] [2024-11-18 09:32:27,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163759036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:27,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584019623] [2024-11-18 09:32:27,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:32:27,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:27,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:27,391 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-18 09:32:27,391 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-18 09:32:27,462 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:32:27,462 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:32:27,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-18 09:32:27,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:27,603 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-18 09:32:27,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:27,993 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-18 09:32:27,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584019623] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:27,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:32:27,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2024-11-18 09:32:27,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859464421] [2024-11-18 09:32:27,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:27,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-18 09:32:27,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:27,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-18 09:32:27,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2024-11-18 09:32:27,995 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-18 09:32:28,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:28,451 INFO L93 Difference]: Finished difference Result 251 states and 330 transitions. [2024-11-18 09:32:28,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-18 09:32:28,451 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-18 09:32:28,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:28,452 INFO L225 Difference]: With dead ends: 251 [2024-11-18 09:32:28,453 INFO L226 Difference]: Without dead ends: 179 [2024-11-18 09:32:28,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=303, Invalid=689, Unknown=0, NotChecked=0, Total=992 [2024-11-18 09:32:28,454 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.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:28,454 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.1s Time] [2024-11-18 09:32:28,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-18 09:32:28,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 172. [2024-11-18 09:32:28,466 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-18 09:32:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 220 transitions. [2024-11-18 09:32:28,469 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 220 transitions. Word has length 55 [2024-11-18 09:32:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:28,470 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 220 transitions. [2024-11-18 09:32:28,470 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-18 09:32:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 220 transitions. [2024-11-18 09:32:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-18 09:32:28,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:28,472 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-18 09:32:28,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 09:32:28,677 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-18 09:32:28,678 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:28,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:28,678 INFO L85 PathProgramCache]: Analyzing trace with hash 858721729, now seen corresponding path program 3 times [2024-11-18 09:32:28,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:28,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653375471] [2024-11-18 09:32:28,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 09:32:28,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:28,716 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-18 09:32:28,716 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-18 09:32:28,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 09:32:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 09:32:28,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 09:32:28,758 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 09:32:28,759 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 09:32:28,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 09:32:28,763 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-11-18 09:32:28,785 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 09:32:28,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:32:28 BoogieIcfgContainer [2024-11-18 09:32:28,787 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 09:32:28,787 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 09:32:28,787 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 09:32:28,787 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 09:32:28,788 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:32:25" (3/4) ... [2024-11-18 09:32:28,789 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 09:32:28,790 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 09:32:28,790 INFO L158 Benchmark]: Toolchain (without parser) took 4193.06ms. Allocated memory was 159.4MB in the beginning and 197.1MB in the end (delta: 37.7MB). Free memory was 91.2MB in the beginning and 107.7MB in the end (delta: -16.5MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-11-18 09:32:28,791 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:32:28,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.96ms. Allocated memory is still 159.4MB. Free memory was 91.0MB in the beginning and 78.5MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 09:32:28,791 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.19ms. Allocated memory is still 159.4MB. Free memory was 78.5MB in the beginning and 76.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 09:32:28,791 INFO L158 Benchmark]: Boogie Preprocessor took 24.49ms. Allocated memory is still 159.4MB. Free memory was 76.8MB in the beginning and 75.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 09:32:28,791 INFO L158 Benchmark]: RCFGBuilder took 259.43ms. Allocated memory is still 159.4MB. Free memory was 74.7MB in the beginning and 63.0MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 09:32:28,791 INFO L158 Benchmark]: TraceAbstraction took 3692.13ms. Allocated memory was 159.4MB in the beginning and 197.1MB in the end (delta: 37.7MB). Free memory was 62.1MB in the beginning and 107.7MB in the end (delta: -45.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:32:28,791 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 197.1MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:32:28,792 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.13ms. Allocated memory is still 113.2MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.96ms. Allocated memory is still 159.4MB. Free memory was 91.0MB in the beginning and 78.5MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.19ms. Allocated memory is still 159.4MB. Free memory was 78.5MB in the beginning and 76.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.49ms. Allocated memory is still 159.4MB. Free memory was 76.8MB in the beginning and 75.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 259.43ms. Allocated memory is still 159.4MB. Free memory was 74.7MB in the beginning and 63.0MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3692.13ms. Allocated memory was 159.4MB in the beginning and 197.1MB in the end (delta: 37.7MB). Free memory was 62.1MB in the beginning and 107.7MB in the end (delta: -45.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 197.1MB. Free memory is still 107.7MB. 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: 3.6s, OverallIterations: 7, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 570 SdHoareTripleChecker+Valid, 0.3s 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, 0.7s 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 37 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 20 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-18 09:32:28,813 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 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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 09:32:30,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 09:32:30,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 09:32:30,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 09:32:30,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 09:32:30,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 09:32:30,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 09:32:30,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 09:32:30,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 09:32:30,643 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 09:32:30,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 09:32:30,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 09:32:30,644 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 09:32:30,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 09:32:30,645 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 09:32:30,645 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 09:32:30,645 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 09:32:30,646 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 09:32:30,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 09:32:30,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 09:32:30,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 09:32:30,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 09:32:30,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 09:32:30,649 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 09:32:30,649 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 09:32:30,650 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 09:32:30,650 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 09:32:30,650 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 09:32:30,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 09:32:30,650 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 09:32:30,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 09:32:30,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 09:32:30,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 09:32:30,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 09:32:30,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:32:30,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 09:32:30,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 09:32:30,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 09:32:30,659 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 09:32:30,659 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 09:32:30,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 09:32:30,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 09:32:30,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 09:32:30,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 09:32:30,660 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-18 09:32:30,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 09:32:30,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 09:32:30,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 09:32:30,939 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 09:32:30,939 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 09:32:30,940 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-18 09:32:32,215 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 09:32:32,368 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 09:32:32,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2024-11-18 09:32:32,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6882472e2/258d94c90cfc4418b1d2764117c28058/FLAG2163956be [2024-11-18 09:32:32,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6882472e2/258d94c90cfc4418b1d2764117c28058 [2024-11-18 09:32:32,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 09:32:32,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 09:32:32,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 09:32:32,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 09:32:32,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 09:32:32,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:32:32" (1/1) ... [2024-11-18 09:32:32,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7279aa1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:32, skipping insertion in model container [2024-11-18 09:32:32,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:32:32" (1/1) ... [2024-11-18 09:32:32,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 09:32:32,560 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-18 09:32:32,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:32:32,586 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 09:32:32,594 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-18 09:32:32,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:32:32,615 INFO L204 MainTranslator]: Completed translation [2024-11-18 09:32:32,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:32 WrapperNode [2024-11-18 09:32:32,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 09:32:32,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 09:32:32,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 09:32:32,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 09:32:32,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:32" (1/1) ... [2024-11-18 09:32:32,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:32" (1/1) ... [2024-11-18 09:32:32,639 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2024-11-18 09:32:32,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 09:32:32,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 09:32:32,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 09:32:32,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 09:32:32,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:32" (1/1) ... [2024-11-18 09:32:32,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:32" (1/1) ... [2024-11-18 09:32:32,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:32" (1/1) ... [2024-11-18 09:32:32,663 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-18 09:32:32,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:32" (1/1) ... [2024-11-18 09:32:32,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:32" (1/1) ... [2024-11-18 09:32:32,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:32" (1/1) ... [2024-11-18 09:32:32,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:32" (1/1) ... [2024-11-18 09:32:32,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:32" (1/1) ... [2024-11-18 09:32:32,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:32" (1/1) ... [2024-11-18 09:32:32,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 09:32:32,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 09:32:32,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 09:32:32,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 09:32:32,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:32" (1/1) ... [2024-11-18 09:32:32,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:32:32,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:32,717 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-18 09:32:32,722 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-18 09:32:32,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 09:32:32,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 09:32:32,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 09:32:32,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 09:32:32,812 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 09:32:32,814 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 09:32:32,903 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-18 09:32:32,903 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 09:32:32,912 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 09:32:32,913 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 09:32:32,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:32:32 BoogieIcfgContainer [2024-11-18 09:32:32,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 09:32:32,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 09:32:32,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 09:32:32,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 09:32:32,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:32:32" (1/3) ... [2024-11-18 09:32:32,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb38860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:32:32, skipping insertion in model container [2024-11-18 09:32:32,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:32" (2/3) ... [2024-11-18 09:32:32,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb38860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:32:32, skipping insertion in model container [2024-11-18 09:32:32,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:32:32" (3/3) ... [2024-11-18 09:32:32,923 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2024-11-18 09:32:32,937 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 09:32:32,938 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 09:32:32,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 09:32:32,996 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;@2c92b084, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 09:32:32,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 09:32:33,000 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-18 09:32:33,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-18 09:32:33,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:33,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-18 09:32:33,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:33,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:33,011 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2024-11-18 09:32:33,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:33,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385714905] [2024-11-18 09:32:33,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:33,021 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-18 09:32:33,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:33,024 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-18 09:32:33,025 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-18 09:32:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:33,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 09:32:33,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:33,108 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-18 09:32:33,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:32:33,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:33,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385714905] [2024-11-18 09:32:33,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385714905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:33,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:33,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 09:32:33,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074274872] [2024-11-18 09:32:33,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:33,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 09:32:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:33,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 09:32:33,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 09:32:33,135 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-18 09:32:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:33,146 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-18 09:32:33,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 09:32:33,148 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-18 09:32:33,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:33,153 INFO L225 Difference]: With dead ends: 21 [2024-11-18 09:32:33,153 INFO L226 Difference]: Without dead ends: 9 [2024-11-18 09:32:33,155 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-18 09:32:33,158 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-18 09:32:33,159 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-18 09:32:33,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-18 09:32:33,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-18 09:32:33,178 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-18 09:32:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-18 09:32:33,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2024-11-18 09:32:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:33,179 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-18 09:32:33,180 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-18 09:32:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2024-11-18 09:32:33,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-18 09:32:33,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:33,180 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-18 09:32:33,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 09:32:33,381 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-18 09:32:33,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:33,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:33,382 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2024-11-18 09:32:33,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:33,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888806997] [2024-11-18 09:32:33,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:33,383 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-18 09:32:33,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:33,384 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-18 09:32:33,386 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-18 09:32:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:33,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 09:32:33,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:33,445 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-18 09:32:33,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:32:33,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:33,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888806997] [2024-11-18 09:32:33,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888806997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:33,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:33,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:32:33,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644081430] [2024-11-18 09:32:33,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:33,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:32:33,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:33,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:32:33,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:32:33,448 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-18 09:32:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:33,460 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-11-18 09:32:33,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:32:33,460 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-18 09:32:33,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:33,461 INFO L225 Difference]: With dead ends: 16 [2024-11-18 09:32:33,461 INFO L226 Difference]: Without dead ends: 12 [2024-11-18 09:32:33,461 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-18 09:32:33,463 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-18 09:32:33,463 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-18 09:32:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-18 09:32:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2024-11-18 09:32:33,465 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-18 09:32:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2024-11-18 09:32:33,465 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2024-11-18 09:32:33,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:33,465 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-11-18 09:32:33,466 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-18 09:32:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2024-11-18 09:32:33,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-18 09:32:33,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:33,466 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:33,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-18 09:32:33,666 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-18 09:32:33,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:33,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:33,667 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2024-11-18 09:32:33,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:33,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782451041] [2024-11-18 09:32:33,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:33,668 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-18 09:32:33,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:33,672 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-18 09:32:33,673 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-18 09:32:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:33,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 09:32:33,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:33,740 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-18 09:32:33,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:32:33,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:33,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782451041] [2024-11-18 09:32:33,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782451041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:33,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:33,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:32:33,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485110156] [2024-11-18 09:32:33,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:33,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:32:33,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:33,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:32:33,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:32:33,743 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-18 09:32:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:33,789 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2024-11-18 09:32:33,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:32:33,790 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-18 09:32:33,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:33,790 INFO L225 Difference]: With dead ends: 19 [2024-11-18 09:32:33,790 INFO L226 Difference]: Without dead ends: 12 [2024-11-18 09:32:33,791 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-18 09:32:33,792 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-18 09:32:33,793 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-18 09:32:33,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-18 09:32:33,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-11-18 09:32:33,797 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-18 09:32:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-11-18 09:32:33,798 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2024-11-18 09:32:33,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:33,798 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-18 09:32:33,799 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-18 09:32:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2024-11-18 09:32:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-18 09:32:33,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:33,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:33,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-18 09:32:34,000 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-18 09:32:34,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:34,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:34,002 INFO L85 PathProgramCache]: Analyzing trace with hash 584467323, now seen corresponding path program 1 times [2024-11-18 09:32:34,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:34,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781379952] [2024-11-18 09:32:34,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:34,002 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-18 09:32:34,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:34,005 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-18 09:32:34,006 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-18 09:32:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:34,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 09:32:34,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:34,051 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-18 09:32:34,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:34,072 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-18 09:32:34,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:34,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781379952] [2024-11-18 09:32:34,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781379952] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:34,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:34,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-18 09:32:34,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575772073] [2024-11-18 09:32:34,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:34,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 09:32:34,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:34,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 09:32:34,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:32:34,075 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-18 09:32:34,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:34,100 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-11-18 09:32:34,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:32:34,101 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-18 09:32:34,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:34,101 INFO L225 Difference]: With dead ends: 23 [2024-11-18 09:32:34,101 INFO L226 Difference]: Without dead ends: 19 [2024-11-18 09:32:34,102 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-18 09:32:34,104 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-18 09:32:34,104 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-18 09:32:34,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-18 09:32:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-18 09:32:34,107 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-18 09:32:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-18 09:32:34,109 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2024-11-18 09:32:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:34,109 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-18 09:32:34,109 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-18 09:32:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-18 09:32:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-18 09:32:34,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:34,110 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:34,113 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-18 09:32:34,310 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-18 09:32:34,311 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:34,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:34,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1843204080, now seen corresponding path program 1 times [2024-11-18 09:32:34,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:34,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922969180] [2024-11-18 09:32:34,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:34,312 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-18 09:32:34,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:34,314 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-18 09:32:34,315 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-18 09:32:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:34,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 09:32:34,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:34,425 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-18 09:32:34,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:34,512 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-18 09:32:34,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:34,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922969180] [2024-11-18 09:32:34,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922969180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:34,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:34,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-18 09:32:34,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762985450] [2024-11-18 09:32:34,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:34,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 09:32:34,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:34,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 09:32:34,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-18 09:32:34,514 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-18 09:32:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:34,617 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-18 09:32:34,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-18 09:32:34,617 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-18 09:32:34,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:34,618 INFO L225 Difference]: With dead ends: 36 [2024-11-18 09:32:34,618 INFO L226 Difference]: Without dead ends: 27 [2024-11-18 09:32:34,618 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-18 09:32:34,619 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-18 09:32:34,619 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-18 09:32:34,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-18 09:32:34,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-18 09:32:34,626 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-18 09:32:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-18 09:32:34,627 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2024-11-18 09:32:34,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:34,627 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-18 09:32:34,627 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-18 09:32:34,628 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-18 09:32:34,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-18 09:32:34,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:34,629 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:34,636 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 (6)] Forceful destruction successful, exit code 0 [2024-11-18 09:32:34,829 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-18 09:32:34,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:34,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:34,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1771704846, now seen corresponding path program 2 times [2024-11-18 09:32:34,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:34,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736317960] [2024-11-18 09:32:34,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:32:34,831 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-18 09:32:34,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:34,832 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-18 09:32:34,833 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-18 09:32:34,853 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:32:34,853 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:32:34,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 09:32:34,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:34,900 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-18 09:32:34,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:34,969 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-18 09:32:34,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:34,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736317960] [2024-11-18 09:32:34,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736317960] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:34,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:34,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-18 09:32:34,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282276013] [2024-11-18 09:32:34,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:34,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 09:32:34,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:34,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 09:32:34,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-18 09:32:34,972 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-18 09:32:35,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:35,050 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2024-11-18 09:32:35,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 09:32:35,051 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-18 09:32:35,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:35,052 INFO L225 Difference]: With dead ends: 35 [2024-11-18 09:32:35,052 INFO L226 Difference]: Without dead ends: 31 [2024-11-18 09:32:35,052 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-18 09:32:35,053 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-18 09:32:35,053 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-18 09:32:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-18 09:32:35,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-18 09:32:35,059 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-18 09:32:35,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-11-18 09:32:35,060 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2024-11-18 09:32:35,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:35,060 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-11-18 09:32:35,060 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-18 09:32:35,060 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-11-18 09:32:35,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-18 09:32:35,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:35,060 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:35,063 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-18 09:32:35,262 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-18 09:32:35,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:35,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:35,263 INFO L85 PathProgramCache]: Analyzing trace with hash -29656432, now seen corresponding path program 3 times [2024-11-18 09:32:35,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:35,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206949875] [2024-11-18 09:32:35,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 09:32:35,264 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-18 09:32:35,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:35,266 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-18 09:32:35,267 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-18 09:32:35,293 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-18 09:32:35,293 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:32:35,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-18 09:32:35,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:35,894 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-18 09:32:35,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:40,370 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-18 09:32:40,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:40,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206949875] [2024-11-18 09:32:40,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206949875] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:40,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:40,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2024-11-18 09:32:40,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982841705] [2024-11-18 09:32:40,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:40,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-18 09:32:40,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:40,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-18 09:32:40,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2024-11-18 09:32:40,373 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-18 09:32:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:41,809 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2024-11-18 09:32:41,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-18 09:32:41,810 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-18 09:32:41,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:41,811 INFO L225 Difference]: With dead ends: 75 [2024-11-18 09:32:41,811 INFO L226 Difference]: Without dead ends: 71 [2024-11-18 09:32:41,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=325, Invalid=1931, Unknown=0, NotChecked=0, Total=2256 [2024-11-18 09:32:41,812 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:41,812 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.5s Time] [2024-11-18 09:32:41,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-18 09:32:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2024-11-18 09:32:41,821 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-18 09:32:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2024-11-18 09:32:41,821 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 30 [2024-11-18 09:32:41,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:41,821 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2024-11-18 09:32:41,821 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-18 09:32:41,822 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2024-11-18 09:32:41,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-18 09:32:41,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:41,822 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:41,826 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-18 09:32:42,024 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-18 09:32:42,024 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:42,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:42,025 INFO L85 PathProgramCache]: Analyzing trace with hash -86914734, now seen corresponding path program 4 times [2024-11-18 09:32:42,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:42,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554504627] [2024-11-18 09:32:42,025 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-18 09:32:42,025 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-18 09:32:42,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:42,027 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-18 09:32:42,030 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-18 09:32:42,050 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-18 09:32:42,050 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:32:42,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-18 09:32:42,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:42,629 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-18 09:32:42,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:43,067 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-18 09:32:43,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:43,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554504627] [2024-11-18 09:32:43,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554504627] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:43,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:43,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 30 [2024-11-18 09:32:43,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044675083] [2024-11-18 09:32:43,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:43,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-18 09:32:43,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:43,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-18 09:32:43,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=575, Unknown=0, NotChecked=0, Total=870 [2024-11-18 09:32:43,069 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-18 09:32:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:43,655 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2024-11-18 09:32:43,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-18 09:32:43,655 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-18 09:32:43,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:43,656 INFO L225 Difference]: With dead ends: 63 [2024-11-18 09:32:43,656 INFO L226 Difference]: Without dead ends: 56 [2024-11-18 09:32:43,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=701, Invalid=1279, Unknown=0, NotChecked=0, Total=1980 [2024-11-18 09:32:43,657 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:43,657 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.2s Time] [2024-11-18 09:32:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-18 09:32:43,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2024-11-18 09:32:43,667 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-18 09:32:43,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2024-11-18 09:32:43,668 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 30 [2024-11-18 09:32:43,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:43,668 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-11-18 09:32:43,669 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-18 09:32:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-11-18 09:32:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-18 09:32:43,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:43,670 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:43,673 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-18 09:32:43,871 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-18 09:32:43,871 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:43,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:43,872 INFO L85 PathProgramCache]: Analyzing trace with hash -709714802, now seen corresponding path program 5 times [2024-11-18 09:32:43,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:43,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314329691] [2024-11-18 09:32:43,872 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-18 09:32:43,872 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-18 09:32:43,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:43,873 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-18 09:32:43,877 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-18 09:32:43,898 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-11-18 09:32:43,899 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:32:43,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-18 09:32:43,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:44,016 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-18 09:32:44,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:44,773 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-18 09:32:44,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:44,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314329691] [2024-11-18 09:32:44,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314329691] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:44,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:44,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19] total 28 [2024-11-18 09:32:44,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864748606] [2024-11-18 09:32:44,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:44,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-18 09:32:44,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:44,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-18 09:32:44,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2024-11-18 09:32:44,775 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-18 09:32:44,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:44,957 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2024-11-18 09:32:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-18 09:32:44,957 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-18 09:32:44,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:44,957 INFO L225 Difference]: With dead ends: 51 [2024-11-18 09:32:44,958 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 09:32:44,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2024-11-18 09:32:44,958 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:44,959 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.1s Time] [2024-11-18 09:32:44,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 09:32:44,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 09:32:44,959 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-18 09:32:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 09:32:44,959 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2024-11-18 09:32:44,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:44,959 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 09:32:44,960 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-18 09:32:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 09:32:44,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 09:32:44,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 09:32:44,965 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-18 09:32:45,162 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-18 09:32:45,165 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2024-11-18 09:32:45,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 09:32:45,385 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 09:32:45,399 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 09:32:45,400 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 09:32:45,401 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 09:32:45,402 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 09:32:45,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:32:45 BoogieIcfgContainer [2024-11-18 09:32:45,405 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 09:32:45,405 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 09:32:45,405 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 09:32:45,405 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 09:32:45,406 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:32:32" (3/4) ... [2024-11-18 09:32:45,407 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 09:32:45,430 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-18 09:32:45,430 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 09:32:45,430 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 09:32:45,430 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 09:32:45,503 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 09:32:45,503 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 09:32:45,503 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 09:32:45,504 INFO L158 Benchmark]: Toolchain (without parser) took 13110.16ms. Allocated memory was 62.9MB in the beginning and 109.1MB in the end (delta: 46.1MB). Free memory was 42.7MB in the beginning and 81.6MB in the end (delta: -39.0MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-18 09:32:45,504 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 62.9MB. Free memory was 37.8MB in the beginning and 37.7MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:32:45,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.59ms. Allocated memory is still 62.9MB. Free memory was 42.6MB in the beginning and 30.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 09:32:45,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.86ms. Allocated memory is still 62.9MB. Free memory was 29.8MB in the beginning and 28.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:32:45,505 INFO L158 Benchmark]: Boogie Preprocessor took 35.90ms. Allocated memory is still 62.9MB. Free memory was 28.3MB in the beginning and 26.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 09:32:45,505 INFO L158 Benchmark]: RCFGBuilder took 236.90ms. Allocated memory was 62.9MB in the beginning and 90.2MB in the end (delta: 27.3MB). Free memory was 26.6MB in the beginning and 62.3MB in the end (delta: -35.7MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2024-11-18 09:32:45,505 INFO L158 Benchmark]: TraceAbstraction took 12488.51ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 61.5MB in the beginning and 85.8MB in the end (delta: -24.3MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2024-11-18 09:32:45,505 INFO L158 Benchmark]: Witness Printer took 98.31ms. Allocated memory is still 109.1MB. Free memory was 85.8MB in the beginning and 81.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 09:32:45,506 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.81ms. Allocated memory is still 62.9MB. Free memory was 37.8MB in the beginning and 37.7MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.59ms. Allocated memory is still 62.9MB. Free memory was 42.6MB in the beginning and 30.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.86ms. Allocated memory is still 62.9MB. Free memory was 29.8MB in the beginning and 28.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.90ms. Allocated memory is still 62.9MB. Free memory was 28.3MB in the beginning and 26.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 236.90ms. Allocated memory was 62.9MB in the beginning and 90.2MB in the end (delta: 27.3MB). Free memory was 26.6MB in the beginning and 62.3MB in the end (delta: -35.7MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12488.51ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 61.5MB in the beginning and 85.8MB in the end (delta: -24.3MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * Witness Printer took 98.31ms. Allocated memory is still 109.1MB. Free memory was 85.8MB in the beginning and 81.6MB 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: 12.2s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 384 SdHoareTripleChecker+Invalid, 0.9s 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, 7.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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.4s 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-18 09:32:45,536 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