./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i -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 e6a9f19f8bc91cee98eed829e929613a36691a9c36f04847231bf1631581216f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:31:35,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:31:35,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:31:35,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:31:35,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:31:35,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:31:35,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:31:35,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:31:35,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:31:35,855 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:31:35,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:31:35,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:31:35,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:31:35,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:31:35,858 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:31:35,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:31:35,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:31:35,859 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:31:35,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:31:35,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:31:35,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:31:35,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:31:35,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:31:35,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:31:35,864 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:31:35,864 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:31:35,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:31:35,864 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:31:35,864 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:31:35,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:31:35,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:31:35,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:31:35,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:31:35,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:31:35,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:31:35,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:31:35,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:31:35,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:31:35,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:31:35,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:31:35,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:31:35,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:31:35,867 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 -> e6a9f19f8bc91cee98eed829e929613a36691a9c36f04847231bf1631581216f [2024-11-16 16:31:36,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:31:36,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:31:36,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:31:36,111 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:31:36,112 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:31:36,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i [2024-11-16 16:31:37,369 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:31:37,570 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:31:37,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i [2024-11-16 16:31:37,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/465043fca/c0cf14e8598745febb4d904b73d399af/FLAG9b96fc78d [2024-11-16 16:31:37,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/465043fca/c0cf14e8598745febb4d904b73d399af [2024-11-16 16:31:37,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:31:37,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:31:37,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:31:37,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:31:37,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:31:37,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:31:37" (1/1) ... [2024-11-16 16:31:37,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2087c589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:37, skipping insertion in model container [2024-11-16 16:31:37,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:31:37" (1/1) ... [2024-11-16 16:31:38,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:31:38,163 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i[915,928] [2024-11-16 16:31:38,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:31:38,202 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:31:38,210 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i[915,928] [2024-11-16 16:31:38,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:31:38,241 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:31:38,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:38 WrapperNode [2024-11-16 16:31:38,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:31:38,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:31:38,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:31:38,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:31:38,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:38" (1/1) ... [2024-11-16 16:31:38,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:38" (1/1) ... [2024-11-16 16:31:38,287 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-16 16:31:38,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:31:38,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:31:38,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:31:38,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:31:38,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:38" (1/1) ... [2024-11-16 16:31:38,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:38" (1/1) ... [2024-11-16 16:31:38,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:38" (1/1) ... [2024-11-16 16:31:38,321 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 16:31:38,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:38" (1/1) ... [2024-11-16 16:31:38,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:38" (1/1) ... [2024-11-16 16:31:38,336 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:38" (1/1) ... [2024-11-16 16:31:38,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:38" (1/1) ... [2024-11-16 16:31:38,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:38" (1/1) ... [2024-11-16 16:31:38,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:38" (1/1) ... [2024-11-16 16:31:38,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:31:38,352 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:31:38,352 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:31:38,352 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:31:38,353 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:38" (1/1) ... [2024-11-16 16:31:38,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:31:38,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:31:38,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 16:31:38,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 16:31:38,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:31:38,427 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:31:38,427 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:31:38,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:31:38,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:31:38,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:31:38,489 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:31:38,490 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:31:38,776 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L81: havoc property_#t~bitwise10#1; [2024-11-16 16:31:38,798 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 16:31:38,798 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:31:38,823 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:31:38,823 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:31:38,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:31:38 BoogieIcfgContainer [2024-11-16 16:31:38,824 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:31:38,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:31:38,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:31:38,833 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:31:38,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:31:37" (1/3) ... [2024-11-16 16:31:38,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255eb4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:31:38, skipping insertion in model container [2024-11-16 16:31:38,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:38" (2/3) ... [2024-11-16 16:31:38,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255eb4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:31:38, skipping insertion in model container [2024-11-16 16:31:38,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:31:38" (3/3) ... [2024-11-16 16:31:38,837 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-37.i [2024-11-16 16:31:38,851 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:31:38,853 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:31:38,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:31:38,904 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;@1d8e2d44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:31:38,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:31:38,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 16:31:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-16 16:31:38,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:38,917 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:38,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:38,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:38,923 INFO L85 PathProgramCache]: Analyzing trace with hash -53597432, now seen corresponding path program 1 times [2024-11-16 16:31:38,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:38,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386385200] [2024-11-16 16:31:38,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:38,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,174 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 16:31:39,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:39,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386385200] [2024-11-16 16:31:39,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386385200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:39,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:39,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:31:39,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946038750] [2024-11-16 16:31:39,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:39,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:31:39,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:39,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:31:39,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:31:39,201 INFO L87 Difference]: Start difference. First operand has 53 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 16:31:39,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:39,223 INFO L93 Difference]: Finished difference Result 98 states and 152 transitions. [2024-11-16 16:31:39,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:31:39,226 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 70 [2024-11-16 16:31:39,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:39,233 INFO L225 Difference]: With dead ends: 98 [2024-11-16 16:31:39,233 INFO L226 Difference]: Without dead ends: 48 [2024-11-16 16:31:39,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-16 16:31:39,238 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:39,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:31:39,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-16 16:31:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-16 16:31:39,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 16:31:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2024-11-16 16:31:39,269 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 70 [2024-11-16 16:31:39,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:39,269 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2024-11-16 16:31:39,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 16:31:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2024-11-16 16:31:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-16 16:31:39,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:39,272 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:39,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:31:39,273 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:39,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:39,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1534940455, now seen corresponding path program 1 times [2024-11-16 16:31:39,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:39,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736742158] [2024-11-16 16:31:39,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:39,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 16:31:39,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:39,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736742158] [2024-11-16 16:31:39,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736742158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:39,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:39,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:31:39,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776315156] [2024-11-16 16:31:39,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:39,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:31:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:39,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:31:39,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:31:39,558 INFO L87 Difference]: Start difference. First operand 48 states and 67 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 16:31:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:39,591 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2024-11-16 16:31:39,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:31:39,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2024-11-16 16:31:39,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:39,595 INFO L225 Difference]: With dead ends: 93 [2024-11-16 16:31:39,595 INFO L226 Difference]: Without dead ends: 48 [2024-11-16 16:31:39,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-16 16:31:39,597 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:39,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:31:39,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-16 16:31:39,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-16 16:31:39,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 16:31:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 66 transitions. [2024-11-16 16:31:39,607 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 66 transitions. Word has length 70 [2024-11-16 16:31:39,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:39,609 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 66 transitions. [2024-11-16 16:31:39,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 16:31:39,610 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2024-11-16 16:31:39,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-16 16:31:39,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:39,611 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:39,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 16:31:39,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:39,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:39,612 INFO L85 PathProgramCache]: Analyzing trace with hash -272514008, now seen corresponding path program 1 times [2024-11-16 16:31:39,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:39,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067890511] [2024-11-16 16:31:39,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:39,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 16:31:39,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:39,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067890511] [2024-11-16 16:31:39,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067890511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 16:31:39,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697124060] [2024-11-16 16:31:39,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:39,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:31:39,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:31:39,844 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-16 16:31:39,846 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-16 16:31:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:39,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 16:31:39,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:31:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 16:31:40,105 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:31:40,269 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 16:31:40,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697124060] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 16:31:40,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 16:31:40,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-16 16:31:40,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947217700] [2024-11-16 16:31:40,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 16:31:40,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 16:31:40,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:40,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 16:31:40,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 16:31:40,272 INFO L87 Difference]: Start difference. First operand 48 states and 66 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-16 16:31:40,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:40,438 INFO L93 Difference]: Finished difference Result 99 states and 134 transitions. [2024-11-16 16:31:40,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 16:31:40,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 70 [2024-11-16 16:31:40,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:40,440 INFO L225 Difference]: With dead ends: 99 [2024-11-16 16:31:40,440 INFO L226 Difference]: Without dead ends: 54 [2024-11-16 16:31:40,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-16 16:31:40,443 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 37 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:40,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 108 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:31:40,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-16 16:31:40,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2024-11-16 16:31:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 16:31:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2024-11-16 16:31:40,453 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 70 [2024-11-16 16:31:40,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:40,453 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2024-11-16 16:31:40,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-16 16:31:40,454 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2024-11-16 16:31:40,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-16 16:31:40,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:40,455 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:40,468 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-16 16:31:40,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:31:40,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:40,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:40,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1760927034, now seen corresponding path program 1 times [2024-11-16 16:31:40,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:40,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173705832] [2024-11-16 16:31:40,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:40,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:40,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:31:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:40,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:31:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:40,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:31:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:40,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:31:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:40,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:31:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:40,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:31:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:40,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:31:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:40,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:31:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:41,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:31:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:41,009 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 16:31:41,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:41,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173705832] [2024-11-16 16:31:41,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173705832] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 16:31:41,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551477652] [2024-11-16 16:31:41,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:41,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:31:41,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:31:41,016 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-16 16:31:41,017 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-16 16:31:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:41,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 16:31:41,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:31:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 16:31:41,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:31:41,393 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 16:31:41,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551477652] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 16:31:41,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 16:31:41,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2024-11-16 16:31:41,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040124682] [2024-11-16 16:31:41,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 16:31:41,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 16:31:41,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:41,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 16:31:41,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-16 16:31:41,397 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2024-11-16 16:31:42,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:42,039 INFO L93 Difference]: Finished difference Result 175 states and 226 transitions. [2024-11-16 16:31:42,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 16:31:42,040 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) Word has length 72 [2024-11-16 16:31:42,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:42,041 INFO L225 Difference]: With dead ends: 175 [2024-11-16 16:31:42,042 INFO L226 Difference]: Without dead ends: 126 [2024-11-16 16:31:42,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2024-11-16 16:31:42,043 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 280 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:42,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 305 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 16:31:42,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-16 16:31:42,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 53. [2024-11-16 16:31:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 16:31:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2024-11-16 16:31:42,056 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 72 [2024-11-16 16:31:42,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:42,057 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2024-11-16 16:31:42,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2024-11-16 16:31:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2024-11-16 16:31:42,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-16 16:31:42,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:42,060 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:42,076 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-16 16:31:42,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-16 16:31:42,262 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:42,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:42,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1746599895, now seen corresponding path program 1 times [2024-11-16 16:31:42,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:42,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402966433] [2024-11-16 16:31:42,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:42,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 16:31:42,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1324573034] [2024-11-16 16:31:42,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:42,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:31:42,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:31:42,312 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-16 16:31:42,313 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-16 16:31:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:42,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 16:31:42,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:31:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 16:31:42,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:31:42,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:31:42,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402966433] [2024-11-16 16:31:42,544 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 16:31:42,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324573034] [2024-11-16 16:31:42,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324573034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:42,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:42,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:31:42,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899413031] [2024-11-16 16:31:42,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:42,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 16:31:42,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:31:42,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 16:31:42,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:31:42,547 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 16:31:42,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:42,628 INFO L93 Difference]: Finished difference Result 154 states and 199 transitions. [2024-11-16 16:31:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 16:31:42,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 73 [2024-11-16 16:31:42,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:42,630 INFO L225 Difference]: With dead ends: 154 [2024-11-16 16:31:42,630 INFO L226 Difference]: Without dead ends: 104 [2024-11-16 16:31:42,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:31:42,631 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 49 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:31:42,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 152 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:31:42,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-16 16:31:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2024-11-16 16:31:42,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 71 states have internal predecessors, (84), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 16:31:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2024-11-16 16:31:42,653 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 73 [2024-11-16 16:31:42,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:42,653 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2024-11-16 16:31:42,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 16:31:42,654 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2024-11-16 16:31:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-16 16:31:42,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:42,655 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:42,669 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-16 16:31:42,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:31:42,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:42,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:42,861 INFO L85 PathProgramCache]: Analyzing trace with hash -977768751, now seen corresponding path program 1 times [2024-11-16 16:31:42,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:31:42,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600251871] [2024-11-16 16:31:42,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:42,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:31:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 16:31:42,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1062297866] [2024-11-16 16:31:42,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:42,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:31:42,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:31:42,912 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 16:31:42,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 16:31:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:31:43,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 16:31:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:31:43,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 16:31:43,094 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 16:31:43,095 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 16:31:43,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 16:31:43,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:31:43,300 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 16:31:43,340 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 16:31:43,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:31:43 BoogieIcfgContainer [2024-11-16 16:31:43,343 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 16:31:43,343 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 16:31:43,343 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 16:31:43,343 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 16:31:43,343 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:31:38" (3/4) ... [2024-11-16 16:31:43,345 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 16:31:43,348 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 16:31:43,349 INFO L158 Benchmark]: Toolchain (without parser) took 5388.43ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 131.3MB in the beginning and 62.6MB in the end (delta: 68.6MB). Peak memory consumption was 103.8MB. Max. memory is 16.1GB. [2024-11-16 16:31:43,349 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:31:43,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.87ms. Allocated memory is still 157.3MB. Free memory was 131.0MB in the beginning and 117.2MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 16:31:43,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.84ms. Allocated memory is still 157.3MB. Free memory was 116.6MB in the beginning and 113.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 16:31:43,349 INFO L158 Benchmark]: Boogie Preprocessor took 62.99ms. Allocated memory is still 157.3MB. Free memory was 113.3MB in the beginning and 108.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 16:31:43,350 INFO L158 Benchmark]: IcfgBuilder took 473.57ms. Allocated memory is still 157.3MB. Free memory was 108.8MB in the beginning and 86.6MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 16:31:43,353 INFO L158 Benchmark]: TraceAbstraction took 4515.92ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 86.0MB in the beginning and 62.6MB in the end (delta: 23.4MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. [2024-11-16 16:31:43,353 INFO L158 Benchmark]: Witness Printer took 5.21ms. Allocated memory is still 192.9MB. Free memory is still 62.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:31:43,354 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.14ms. Allocated memory is still 111.1MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.87ms. Allocated memory is still 157.3MB. Free memory was 131.0MB in the beginning and 117.2MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.84ms. Allocated memory is still 157.3MB. Free memory was 116.6MB in the beginning and 113.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.99ms. Allocated memory is still 157.3MB. Free memory was 113.3MB in the beginning and 108.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 473.57ms. Allocated memory is still 157.3MB. Free memory was 108.8MB in the beginning and 86.6MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4515.92ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 86.0MB in the beginning and 62.6MB in the end (delta: 23.4MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. * Witness Printer took 5.21ms. Allocated memory is still 192.9MB. Free memory is still 62.6MB. 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: 19]: 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 someBinaryDOUBLEComparisonOperation at line 81, overapproximation of bitwiseOr at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 8; [L23] unsigned short int var_1_2 = 59049; [L24] unsigned char var_1_6 = 4; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 64; [L27] unsigned long int var_1_9 = 64; [L28] unsigned long int var_1_10 = 1776833134; [L29] signed long int var_1_11 = -16; [L30] double var_1_12 = 0.25; [L31] double var_1_13 = 5.5; [L32] unsigned char last_1_var_1_8 = 64; [L33] signed long int last_1_var_1_11 = -16; VAL [isInitial=0, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=59049, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L77] last_1_var_1_8 = var_1_8 [L78] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=59049, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L88] RET updateLastVariables() [L89] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_ushort() [L62] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L62] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L63] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L63] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L64] var_1_6 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_7=1, var_1_8=64, var_1_9=64] [L65] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_7=1, var_1_8=64, var_1_9=64] [L66] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L66] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L67] var_1_7 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_8=64, var_1_9=64] [L68] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_8=64, var_1_9=64] [L69] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L69] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L70] var_1_10 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_10 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L71] RET assume_abort_if_not(var_1_10 >= 1073741824) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L72] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L72] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L73] var_1_13 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L74] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L89] RET updateVariables() [L90] CALL step() [L37] EXPR (var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L37] COND TRUE ((var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11)) <= -64 [L38] var_1_1 = ((((1) < (((((16) > (var_1_6)) ? (16) : (var_1_6))))) ? (1) : (((((16) > (var_1_6)) ? (16) : (var_1_6)))))) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L44] var_1_11 = var_1_1 VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L45] COND TRUE var_1_1 >= ((((var_1_11 / var_1_2) < 0 ) ? -(var_1_11 / var_1_2) : (var_1_11 / var_1_2))) [L46] var_1_8 = var_1_6 VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=64] [L52] unsigned char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, stepLocal_0=1, var_1_10=1073741824, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=64] [L53] COND FALSE !(var_1_1 > stepLocal_0) [L56] var_1_9 = ((1228227409u + var_1_10) - var_1_11) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2301969232] [L58] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2301969232] [L90] RET step() [L91] CALL, EXPR property() [L81] EXPR (var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2301969232] [L81-L82] return (((((((var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11)) <= -64) ? (var_1_1 == ((unsigned char) ((((1) < (((((16) > (var_1_6)) ? (16) : (var_1_6))))) ? (1) : (((((16) > (var_1_6)) ? (16) : (var_1_6)))))))) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_6)) : 1)) && ((var_1_1 >= ((((var_1_11 / var_1_2) < 0 ) ? -(var_1_11 / var_1_2) : (var_1_11 / var_1_2)))) ? (var_1_8 == ((unsigned char) var_1_6)) : (var_1_7 ? (var_1_8 == ((unsigned char) var_1_6)) : 1))) && ((var_1_1 > var_1_1) ? (var_1_9 == ((unsigned long int) var_1_2)) : (var_1_9 == ((unsigned long int) ((1228227409u + var_1_10) - var_1_11))))) && (var_1_11 == ((signed long int) var_1_1))) && (var_1_12 == ((double) var_1_13)) ; [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2301969232] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2301969232] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 366 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 366 mSDsluCounter, 746 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 473 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 445 IncrementalHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 273 mSDtfsCounter, 445 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, InterpolantAutomatonStates: 37, 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, 5 MinimizatonAttempts, 85 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 722 NumberOfCodeBlocks, 722 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 630 ConstructedInterpolants, 0 QuantifiedInterpolants, 1948 SizeOfPredicates, 8 NumberOfNonLiveVariables, 545 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 1152/1296 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 16:31:43,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i -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 e6a9f19f8bc91cee98eed829e929613a36691a9c36f04847231bf1631581216f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:31:45,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:31:45,349 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 16:31:45,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:31:45,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:31:45,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:31:45,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:31:45,386 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:31:45,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:31:45,388 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:31:45,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:31:45,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:31:45,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:31:45,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:31:45,391 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:31:45,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:31:45,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:31:45,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:31:45,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:31:45,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:31:45,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:31:45,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:31:45,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:31:45,396 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 16:31:45,396 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 16:31:45,396 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:31:45,397 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 16:31:45,397 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:31:45,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:31:45,398 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:31:45,398 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:31:45,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:31:45,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:31:45,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:31:45,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:31:45,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:31:45,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:31:45,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:31:45,400 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 16:31:45,400 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 16:31:45,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:31:45,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:31:45,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:31:45,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:31:45,402 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 -> e6a9f19f8bc91cee98eed829e929613a36691a9c36f04847231bf1631581216f [2024-11-16 16:31:45,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:31:45,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:31:45,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:31:45,704 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:31:45,705 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:31:45,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i [2024-11-16 16:31:47,080 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:31:47,250 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:31:47,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i [2024-11-16 16:31:47,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea9bbdd8e/f44ba9263c594462a4faad03edf319e5/FLAG1d64d8b47 [2024-11-16 16:31:47,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea9bbdd8e/f44ba9263c594462a4faad03edf319e5 [2024-11-16 16:31:47,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:31:47,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:31:47,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:31:47,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:31:47,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:31:47,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:31:47" (1/1) ... [2024-11-16 16:31:47,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f243be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:47, skipping insertion in model container [2024-11-16 16:31:47,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:31:47" (1/1) ... [2024-11-16 16:31:47,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:31:47,468 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i[915,928] [2024-11-16 16:31:47,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:31:47,526 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:31:47,539 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i[915,928] [2024-11-16 16:31:47,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:31:47,584 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:31:47,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:47 WrapperNode [2024-11-16 16:31:47,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:31:47,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:31:47,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:31:47,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:31:47,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:47" (1/1) ... [2024-11-16 16:31:47,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:47" (1/1) ... [2024-11-16 16:31:47,640 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2024-11-16 16:31:47,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:31:47,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:31:47,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:31:47,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:31:47,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:47" (1/1) ... [2024-11-16 16:31:47,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:47" (1/1) ... [2024-11-16 16:31:47,653 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:47" (1/1) ... [2024-11-16 16:31:47,662 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 16:31:47,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:47" (1/1) ... [2024-11-16 16:31:47,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:47" (1/1) ... [2024-11-16 16:31:47,670 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:47" (1/1) ... [2024-11-16 16:31:47,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:47" (1/1) ... [2024-11-16 16:31:47,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:47" (1/1) ... [2024-11-16 16:31:47,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:47" (1/1) ... [2024-11-16 16:31:47,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:31:47,676 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:31:47,676 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:31:47,676 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:31:47,677 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:47" (1/1) ... [2024-11-16 16:31:47,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:31:47,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:31:47,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 16:31:47,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 16:31:47,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:31:47,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 16:31:47,748 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:31:47,748 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:31:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:31:47,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:31:47,819 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:31:47,822 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:31:48,089 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 16:31:48,089 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:31:48,103 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:31:48,104 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:31:48,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:31:48 BoogieIcfgContainer [2024-11-16 16:31:48,104 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:31:48,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:31:48,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:31:48,111 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:31:48,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:31:47" (1/3) ... [2024-11-16 16:31:48,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716046eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:31:48, skipping insertion in model container [2024-11-16 16:31:48,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:47" (2/3) ... [2024-11-16 16:31:48,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716046eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:31:48, skipping insertion in model container [2024-11-16 16:31:48,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:31:48" (3/3) ... [2024-11-16 16:31:48,114 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-37.i [2024-11-16 16:31:48,130 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:31:48,130 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:31:48,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:31:48,192 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;@13180332, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:31:48,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:31:48,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 16:31:48,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-16 16:31:48,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:48,204 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:48,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:48,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:48,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1679348567, now seen corresponding path program 1 times [2024-11-16 16:31:48,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:31:48,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890845937] [2024-11-16 16:31:48,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:48,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:31:48,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:31:48,225 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:31:48,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 16:31:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:48,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 16:31:48,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:31:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-16 16:31:48,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:31:48,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:31:48,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890845937] [2024-11-16 16:31:48,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890845937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:31:48,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:31:48,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:31:48,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066233755] [2024-11-16 16:31:48,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:31:48,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:31:48,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:31:48,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:31:48,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:31:48,454 INFO L87 Difference]: Start difference. First operand has 44 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 16:31:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:31:48,469 INFO L93 Difference]: Finished difference Result 80 states and 122 transitions. [2024-11-16 16:31:48,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:31:48,471 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2024-11-16 16:31:48,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:31:48,476 INFO L225 Difference]: With dead ends: 80 [2024-11-16 16:31:48,476 INFO L226 Difference]: Without dead ends: 39 [2024-11-16 16:31:48,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 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-16 16:31:48,480 INFO L432 NwaCegarLoop]: 52 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, 52 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-16 16:31:48,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:31:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-16 16:31:48,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-16 16:31:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 16:31:48,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-11-16 16:31:48,509 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 67 [2024-11-16 16:31:48,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:31:48,510 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-11-16 16:31:48,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 16:31:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2024-11-16 16:31:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-16 16:31:48,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:31:48,512 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:31:48,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 16:31:48,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:31:48,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:31:48,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:31:48,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1306790504, now seen corresponding path program 1 times [2024-11-16 16:31:48,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:31:48,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160662892] [2024-11-16 16:31:48,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:31:48,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:31:48,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:31:48,719 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:31:48,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 16:31:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:31:48,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 16:31:48,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:32:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 16:32:10,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:32:10,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:32:10,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160662892] [2024-11-16 16:32:10,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160662892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:32:10,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:32:10,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 16:32:10,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171727596] [2024-11-16 16:32:10,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:32:10,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 16:32:10,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:32:10,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 16:32:10,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-16 16:32:10,671 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 16:32:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:32:12,404 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2024-11-16 16:32:12,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 16:32:12,406 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 67 [2024-11-16 16:32:12,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:32:12,407 INFO L225 Difference]: With dead ends: 102 [2024-11-16 16:32:12,407 INFO L226 Difference]: Without dead ends: 66 [2024-11-16 16:32:12,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2024-11-16 16:32:12,409 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 113 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 16:32:12,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 195 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 16:32:12,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-16 16:32:12,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2024-11-16 16:32:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 16:32:12,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2024-11-16 16:32:12,418 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 67 [2024-11-16 16:32:12,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:32:12,418 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2024-11-16 16:32:12,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 16:32:12,419 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2024-11-16 16:32:12,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-16 16:32:12,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:32:12,420 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:32:12,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 16:32:12,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:32:12,621 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:32:12,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:32:12,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2100673111, now seen corresponding path program 1 times [2024-11-16 16:32:12,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:32:12,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452160271] [2024-11-16 16:32:12,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:32:12,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:32:12,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:32:12,625 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:32:12,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 16:32:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:32:12,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 16:32:12,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:32:12,710 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 16:32:12,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:32:12,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:32:12,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452160271] [2024-11-16 16:32:12,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452160271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:32:12,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:32:12,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:32:12,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734649593] [2024-11-16 16:32:12,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:32:12,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:32:12,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:32:12,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:32:12,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:32:12,713 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 16:32:12,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:32:12,776 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2024-11-16 16:32:12,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:32:12,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 67 [2024-11-16 16:32:12,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:32:12,782 INFO L225 Difference]: With dead ends: 99 [2024-11-16 16:32:12,782 INFO L226 Difference]: Without dead ends: 51 [2024-11-16 16:32:12,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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-16 16:32:12,783 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:32:12,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:32:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-16 16:32:12,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-16 16:32:12,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 16:32:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2024-11-16 16:32:12,790 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 67 [2024-11-16 16:32:12,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:32:12,790 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2024-11-16 16:32:12,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 16:32:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2024-11-16 16:32:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-16 16:32:12,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:32:12,794 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:32:12,800 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-16 16:32:12,994 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-16 16:32:12,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:32:12,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:32:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash 187358763, now seen corresponding path program 1 times [2024-11-16 16:32:12,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:32:12,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704918609] [2024-11-16 16:32:12,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:32:12,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:32:12,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:32:13,001 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-16 16:32:13,002 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-16 16:32:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:32:13,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 16:32:13,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:32:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 16:32:13,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:32:13,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:32:13,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704918609] [2024-11-16 16:32:13,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704918609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 16:32:13,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [948901758] [2024-11-16 16:32:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:32:13,716 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 16:32:13,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 16:32:13,718 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 16:32:13,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-16 16:32:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:32:14,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-16 16:32:14,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:32:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 16:32:33,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:32:33,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [948901758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:32:33,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 16:32:33,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 16 [2024-11-16 16:32:33,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861023567] [2024-11-16 16:32:33,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:32:33,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 16:32:33,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:32:33,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 16:32:33,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-11-16 16:32:33,486 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 16:32:42,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:32:42,962 INFO L93 Difference]: Finished difference Result 178 states and 214 transitions. [2024-11-16 16:32:42,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 16:32:42,968 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 68 [2024-11-16 16:32:42,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:32:42,969 INFO L225 Difference]: With dead ends: 178 [2024-11-16 16:32:42,970 INFO L226 Difference]: Without dead ends: 130 [2024-11-16 16:32:42,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2024-11-16 16:32:42,971 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 98 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-16 16:32:42,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 311 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-16 16:32:42,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-16 16:32:42,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 81. [2024-11-16 16:32:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 16:32:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2024-11-16 16:32:42,995 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 68 [2024-11-16 16:32:42,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:32:42,998 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2024-11-16 16:32:42,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 16:32:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2024-11-16 16:32:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-16 16:32:43,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:32:43,001 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:32:43,011 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-16 16:32:43,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-16 16:32:43,401 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-16 16:32:43,402 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:32:43,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:32:43,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1609592596, now seen corresponding path program 1 times [2024-11-16 16:32:43,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:32:43,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21262140] [2024-11-16 16:32:43,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:32:43,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:32:43,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:32:43,405 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-16 16:32:43,407 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-16 16:32:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:32:43,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 16:32:43,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:32:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 16:32:43,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:32:44,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:32:44,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21262140] [2024-11-16 16:32:44,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21262140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 16:32:44,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1604979796] [2024-11-16 16:32:44,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:32:44,152 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 16:32:44,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 16:32:44,153 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 16:32:44,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-16 16:32:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:32:44,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-16 16:32:44,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:33:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 16:33:01,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:33:01,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1604979796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:33:01,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 16:33:01,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2024-11-16 16:33:01,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566099140] [2024-11-16 16:33:01,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:33:01,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 16:33:01,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:33:01,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 16:33:01,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2024-11-16 16:33:01,091 INFO L87 Difference]: Start difference. First operand 81 states and 102 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 16:33:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:33:07,264 INFO L93 Difference]: Finished difference Result 142 states and 176 transitions. [2024-11-16 16:33:07,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 16:33:07,264 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 68 [2024-11-16 16:33:07,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:33:07,265 INFO L225 Difference]: With dead ends: 142 [2024-11-16 16:33:07,266 INFO L226 Difference]: Without dead ends: 94 [2024-11-16 16:33:07,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2024-11-16 16:33:07,267 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 34 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-16 16:33:07,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 257 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-16 16:33:07,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-16 16:33:07,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 81. [2024-11-16 16:33:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 16:33:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2024-11-16 16:33:07,276 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 68 [2024-11-16 16:33:07,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:33:07,276 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2024-11-16 16:33:07,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 16:33:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2024-11-16 16:33:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-16 16:33:07,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:33:07,278 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:33:07,284 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-16 16:33:07,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-16 16:33:07,678 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-16 16:33:07,679 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:33:07,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:33:07,679 INFO L85 PathProgramCache]: Analyzing trace with hash 857059387, now seen corresponding path program 1 times [2024-11-16 16:33:07,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:33:07,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139913976] [2024-11-16 16:33:07,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:33:07,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:33:07,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:33:07,682 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-16 16:33:07,683 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-16 16:33:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:33:07,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 16:33:07,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:33:08,047 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 16:33:08,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:33:08,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:33:08,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139913976] [2024-11-16 16:33:08,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139913976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 16:33:08,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1903056005] [2024-11-16 16:33:08,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:33:08,304 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 16:33:08,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 16:33:08,306 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 16:33:08,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-16 16:33:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:33:08,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-16 16:33:08,735 INFO L278 TraceCheckSpWp]: Computing forward predicates...