./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_operatoramount_amount50_file-78.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 c60f372b7dc1b4532187e57acf518ccbf786ab918ffb900907557784c73c0567 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:57:18,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:57:18,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:57:18,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:57:18,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:57:18,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:57:18,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:57:18,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:57:18,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:57:18,775 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:57:18,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:57:18,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:57:18,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:57:18,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:57:18,778 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:57:18,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:57:18,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:57:18,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:57:18,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:57:18,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:57:18,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:57:18,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:57:18,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:57:18,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:57:18,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:57:18,782 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:57:18,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:57:18,783 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:57:18,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:57:18,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:57:18,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:57:18,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:57:18,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:57:18,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:57:18,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:57:18,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:57:18,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:57:18,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:57:18,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:57:18,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:57:18,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:57:18,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:57:18,787 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 -> c60f372b7dc1b4532187e57acf518ccbf786ab918ffb900907557784c73c0567 [2024-11-10 08:57:19,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:57:19,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:57:19,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:57:19,059 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:57:19,059 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:57:19,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-78.i [2024-11-10 08:57:20,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:57:20,670 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:57:20,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-78.i [2024-11-10 08:57:20,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36c7155ec/cae48b8250944c1fbc02195cdc048094/FLAG0c0697d0f [2024-11-10 08:57:21,025 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36c7155ec/cae48b8250944c1fbc02195cdc048094 [2024-11-10 08:57:21,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:57:21,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:57:21,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:57:21,032 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:57:21,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:57:21,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:57:21" (1/1) ... [2024-11-10 08:57:21,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45bf056c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:21, skipping insertion in model container [2024-11-10 08:57:21,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:57:21" (1/1) ... [2024-11-10 08:57:21,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:57:21,331 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_operatoramount_amount50_file-78.i[915,928] [2024-11-10 08:57:21,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:57:21,434 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:57:21,449 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_operatoramount_amount50_file-78.i[915,928] [2024-11-10 08:57:21,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:57:21,512 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:57:21,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:21 WrapperNode [2024-11-10 08:57:21,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:57:21,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:57:21,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:57:21,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:57:21,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:21" (1/1) ... [2024-11-10 08:57:21,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:21" (1/1) ... [2024-11-10 08:57:21,582 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-11-10 08:57:21,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:57:21,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:57:21,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:57:21,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:57:21,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:21" (1/1) ... [2024-11-10 08:57:21,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:21" (1/1) ... [2024-11-10 08:57:21,598 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:21" (1/1) ... [2024-11-10 08:57:21,622 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-10 08:57:21,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:21" (1/1) ... [2024-11-10 08:57:21,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:21" (1/1) ... [2024-11-10 08:57:21,639 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:21" (1/1) ... [2024-11-10 08:57:21,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:21" (1/1) ... [2024-11-10 08:57:21,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:21" (1/1) ... [2024-11-10 08:57:21,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:21" (1/1) ... [2024-11-10 08:57:21,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:57:21,652 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:57:21,652 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:57:21,652 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:57:21,653 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:21" (1/1) ... [2024-11-10 08:57:21,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:57:21,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:57:21,695 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-10 08:57:21,702 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-10 08:57:21,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:57:21,741 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:57:21,741 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:57:21,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:57:21,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:57:21,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:57:21,842 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:57:21,844 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:57:22,291 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~bitwise17#1;havoc property_#t~short18#1;havoc property_#t~bitwise19#1;havoc property_#t~short20#1; [2024-11-10 08:57:22,331 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-10 08:57:22,331 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:57:22,370 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:57:22,370 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:57:22,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:57:22 BoogieIcfgContainer [2024-11-10 08:57:22,371 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:57:22,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:57:22,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:57:22,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:57:22,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:57:21" (1/3) ... [2024-11-10 08:57:22,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf14c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:57:22, skipping insertion in model container [2024-11-10 08:57:22,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:21" (2/3) ... [2024-11-10 08:57:22,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf14c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:57:22, skipping insertion in model container [2024-11-10 08:57:22,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:57:22" (3/3) ... [2024-11-10 08:57:22,380 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-78.i [2024-11-10 08:57:22,405 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:57:22,406 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:57:22,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:57:22,487 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;@1af517f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:57:22,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:57:22,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 60 states have (on average 1.4) internal successors, (84), 61 states have internal predecessors, (84), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 08:57:22,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 08:57:22,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:57:22,510 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:57:22,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:57:22,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:57:22,515 INFO L85 PathProgramCache]: Analyzing trace with hash -2027122653, now seen corresponding path program 1 times [2024-11-10 08:57:22,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:57:22,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300778119] [2024-11-10 08:57:22,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:57:22,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:57:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:57:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:57:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:57:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:57:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:57:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:57:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:57:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:57:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:57:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 08:57:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 08:57:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 08:57:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:57:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:57:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:57:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:57:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:57:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:57:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:22,930 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:57:22,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:57:22,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300778119] [2024-11-10 08:57:22,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300778119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:57:22,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:57:22,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:57:22,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40570562] [2024-11-10 08:57:22,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:57:22,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:57:22,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:57:22,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:57:22,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:57:22,962 INFO L87 Difference]: Start difference. First operand has 81 states, 60 states have (on average 1.4) internal successors, (84), 61 states have internal predecessors, (84), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 08:57:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:57:23,006 INFO L93 Difference]: Finished difference Result 154 states and 251 transitions. [2024-11-10 08:57:23,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:57:23,010 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 126 [2024-11-10 08:57:23,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:57:23,021 INFO L225 Difference]: With dead ends: 154 [2024-11-10 08:57:23,022 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 08:57:23,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-10 08:57:23,028 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:57:23,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:57:23,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 08:57:23,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-10 08:57:23,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 08:57:23,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 112 transitions. [2024-11-10 08:57:23,070 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 112 transitions. Word has length 126 [2024-11-10 08:57:23,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:57:23,070 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 112 transitions. [2024-11-10 08:57:23,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 08:57:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 112 transitions. [2024-11-10 08:57:23,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 08:57:23,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:57:23,074 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:57:23,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:57:23,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:57:23,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:57:23,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1883777501, now seen corresponding path program 1 times [2024-11-10 08:57:23,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:57:23,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473678966] [2024-11-10 08:57:23,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:57:23,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:57:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:57:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:57:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:57:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:57:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:57:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:57:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:57:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:57:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:57:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 08:57:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 08:57:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 08:57:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:57:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:57:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:57:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:57:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:57:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:57:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:57:23,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:57:23,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473678966] [2024-11-10 08:57:23,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473678966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:57:23,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:57:23,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:57:23,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104965874] [2024-11-10 08:57:23,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:57:23,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:57:23,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:57:23,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:57:23,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:57:23,438 INFO L87 Difference]: Start difference. First operand 76 states and 112 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:23,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:57:23,490 INFO L93 Difference]: Finished difference Result 149 states and 221 transitions. [2024-11-10 08:57:23,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 08:57:23,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-11-10 08:57:23,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:57:23,494 INFO L225 Difference]: With dead ends: 149 [2024-11-10 08:57:23,495 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 08:57:23,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:57:23,499 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:57:23,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:57:23,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 08:57:23,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-10 08:57:23,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 08:57:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2024-11-10 08:57:23,520 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 126 [2024-11-10 08:57:23,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:57:23,523 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2024-11-10 08:57:23,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2024-11-10 08:57:23,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 08:57:23,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:57:23,527 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:57:23,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:57:23,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:57:23,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:57:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1474538626, now seen corresponding path program 1 times [2024-11-10 08:57:23,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:57:23,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707456504] [2024-11-10 08:57:23,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:57:23,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:57:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:57:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:57:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:57:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:57:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:57:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:57:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:57:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:57:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:57:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 08:57:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 08:57:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 08:57:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:57:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:57:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:57:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:57:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:57:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:57:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:57:23,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:57:23,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707456504] [2024-11-10 08:57:23,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707456504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:57:23,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:57:23,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:57:23,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237777973] [2024-11-10 08:57:23,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:57:23,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:57:23,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:57:23,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:57:23,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:57:23,944 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:24,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:57:24,156 INFO L93 Difference]: Finished difference Result 224 states and 329 transitions. [2024-11-10 08:57:24,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 08:57:24,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-10 08:57:24,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:57:24,160 INFO L225 Difference]: With dead ends: 224 [2024-11-10 08:57:24,160 INFO L226 Difference]: Without dead ends: 151 [2024-11-10 08:57:24,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-10 08:57:24,162 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 86 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:57:24,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 283 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:57:24,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-10 08:57:24,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 132. [2024-11-10 08:57:24,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 08:57:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 195 transitions. [2024-11-10 08:57:24,189 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 195 transitions. Word has length 127 [2024-11-10 08:57:24,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:57:24,190 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 195 transitions. [2024-11-10 08:57:24,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:24,191 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 195 transitions. [2024-11-10 08:57:24,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 08:57:24,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:57:24,193 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:57:24,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:57:24,193 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:57:24,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:57:24,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1688715036, now seen corresponding path program 1 times [2024-11-10 08:57:24,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:57:24,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661552963] [2024-11-10 08:57:24,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:57:24,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:57:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:57:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:57:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:57:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:57:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:57:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:57:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:57:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:57:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:57:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 08:57:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 08:57:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 08:57:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:57:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:57:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:57:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:57:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:57:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:57:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:57:24,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:57:24,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661552963] [2024-11-10 08:57:24,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661552963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:57:24,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:57:24,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:57:24,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86272429] [2024-11-10 08:57:24,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:57:24,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:57:24,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:57:24,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:57:24,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:57:24,479 INFO L87 Difference]: Start difference. First operand 132 states and 195 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:57:24,654 INFO L93 Difference]: Finished difference Result 319 states and 469 transitions. [2024-11-10 08:57:24,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 08:57:24,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 128 [2024-11-10 08:57:24,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:57:24,659 INFO L225 Difference]: With dead ends: 319 [2024-11-10 08:57:24,662 INFO L226 Difference]: Without dead ends: 230 [2024-11-10 08:57:24,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-10 08:57:24,667 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 127 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:57:24,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 310 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:57:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-10 08:57:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 209. [2024-11-10 08:57:24,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 151 states have (on average 1.3245033112582782) internal successors, (200), 151 states have internal predecessors, (200), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 08:57:24,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 308 transitions. [2024-11-10 08:57:24,709 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 308 transitions. Word has length 128 [2024-11-10 08:57:24,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:57:24,714 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 308 transitions. [2024-11-10 08:57:24,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:24,714 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 308 transitions. [2024-11-10 08:57:24,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 08:57:24,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:57:24,716 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:57:24,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 08:57:24,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:57:24,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:57:24,717 INFO L85 PathProgramCache]: Analyzing trace with hash -569775205, now seen corresponding path program 1 times [2024-11-10 08:57:24,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:57:24,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843097540] [2024-11-10 08:57:24,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:57:24,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:57:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:57:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:57:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:57:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:57:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:57:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:57:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:57:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:57:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:57:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 08:57:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 08:57:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 08:57:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:57:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:57:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:57:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:57:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:57:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:57:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:57:25,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:57:25,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843097540] [2024-11-10 08:57:25,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843097540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:57:25,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:57:25,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 08:57:25,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534974323] [2024-11-10 08:57:25,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:57:25,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 08:57:25,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:57:25,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 08:57:25,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:57:25,066 INFO L87 Difference]: Start difference. First operand 209 states and 308 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:25,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:57:25,358 INFO L93 Difference]: Finished difference Result 599 states and 873 transitions. [2024-11-10 08:57:25,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 08:57:25,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-11-10 08:57:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:57:25,362 INFO L225 Difference]: With dead ends: 599 [2024-11-10 08:57:25,362 INFO L226 Difference]: Without dead ends: 445 [2024-11-10 08:57:25,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-10 08:57:25,364 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 275 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:57:25,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 618 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:57:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-10 08:57:25,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 372. [2024-11-10 08:57:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 276 states have (on average 1.3478260869565217) internal successors, (372), 276 states have internal predecessors, (372), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-10 08:57:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 552 transitions. [2024-11-10 08:57:25,421 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 552 transitions. Word has length 129 [2024-11-10 08:57:25,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:57:25,421 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 552 transitions. [2024-11-10 08:57:25,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:25,422 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 552 transitions. [2024-11-10 08:57:25,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 08:57:25,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:57:25,423 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:57:25,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 08:57:25,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:57:25,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:57:25,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1928240732, now seen corresponding path program 1 times [2024-11-10 08:57:25,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:57:25,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612452870] [2024-11-10 08:57:25,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:57:25,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:57:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:57:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:57:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:57:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:57:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:57:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:57:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:57:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:57:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:57:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 08:57:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 08:57:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 08:57:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:57:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:57:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:57:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:57:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:57:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:57:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:57:25,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:57:25,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612452870] [2024-11-10 08:57:25,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612452870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:57:25,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:57:25,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:57:25,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084588908] [2024-11-10 08:57:25,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:57:25,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:57:25,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:57:25,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:57:25,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:57:25,786 INFO L87 Difference]: Start difference. First operand 372 states and 552 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:57:25,977 INFO L93 Difference]: Finished difference Result 768 states and 1129 transitions. [2024-11-10 08:57:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 08:57:25,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-11-10 08:57:25,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:57:25,982 INFO L225 Difference]: With dead ends: 768 [2024-11-10 08:57:25,982 INFO L226 Difference]: Without dead ends: 439 [2024-11-10 08:57:25,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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-10 08:57:25,984 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 78 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:57:25,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 283 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:57:25,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-10 08:57:26,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 380. [2024-11-10 08:57:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 284 states have (on average 1.3345070422535212) internal successors, (379), 284 states have internal predecessors, (379), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-10 08:57:26,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 559 transitions. [2024-11-10 08:57:26,031 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 559 transitions. Word has length 129 [2024-11-10 08:57:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:57:26,032 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 559 transitions. [2024-11-10 08:57:26,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 559 transitions. [2024-11-10 08:57:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 08:57:26,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:57:26,034 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:57:26,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 08:57:26,034 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:57:26,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:57:26,034 INFO L85 PathProgramCache]: Analyzing trace with hash 216141867, now seen corresponding path program 1 times [2024-11-10 08:57:26,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:57:26,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691802366] [2024-11-10 08:57:26,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:57:26,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:57:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:57:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:57:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:57:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:57:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:57:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:57:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:57:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:57:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:57:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 08:57:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 08:57:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 08:57:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:57:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:57:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:57:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:57:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:57:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:57:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:57:26,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:57:26,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691802366] [2024-11-10 08:57:26,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691802366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:57:26,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:57:26,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:57:26,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628670164] [2024-11-10 08:57:26,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:57:26,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:57:26,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:57:26,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:57:26,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:57:26,401 INFO L87 Difference]: Start difference. First operand 380 states and 559 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:57:26,669 INFO L93 Difference]: Finished difference Result 961 states and 1411 transitions. [2024-11-10 08:57:26,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:57:26,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-10 08:57:26,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:57:26,675 INFO L225 Difference]: With dead ends: 961 [2024-11-10 08:57:26,675 INFO L226 Difference]: Without dead ends: 631 [2024-11-10 08:57:26,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:57:26,677 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 123 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:57:26,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 433 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:57:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-10 08:57:26,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 539. [2024-11-10 08:57:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 405 states have (on average 1.325925925925926) internal successors, (537), 405 states have internal predecessors, (537), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-10 08:57:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 789 transitions. [2024-11-10 08:57:26,740 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 789 transitions. Word has length 130 [2024-11-10 08:57:26,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:57:26,741 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 789 transitions. [2024-11-10 08:57:26,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:26,741 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 789 transitions. [2024-11-10 08:57:26,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 08:57:26,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:57:26,744 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:57:26,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 08:57:26,744 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:57:26,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:57:26,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1723693676, now seen corresponding path program 1 times [2024-11-10 08:57:26,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:57:26,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459456626] [2024-11-10 08:57:26,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:57:26,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:57:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:57:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:57:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:57:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:57:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:57:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:26,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:57:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:27,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:57:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:27,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:57:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:27,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:57:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:27,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 08:57:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:27,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 08:57:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:27,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 08:57:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:27,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:57:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:27,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:57:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:27,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:57:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:27,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:57:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:27,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:57:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:27,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:57:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:57:27,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:57:27,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459456626] [2024-11-10 08:57:27,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459456626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:57:27,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:57:27,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:57:27,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536498665] [2024-11-10 08:57:27,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:57:27,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:57:27,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:57:27,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:57:27,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:57:27,020 INFO L87 Difference]: Start difference. First operand 539 states and 789 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:57:27,177 INFO L93 Difference]: Finished difference Result 1101 states and 1621 transitions. [2024-11-10 08:57:27,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:57:27,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-10 08:57:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:57:27,184 INFO L225 Difference]: With dead ends: 1101 [2024-11-10 08:57:27,184 INFO L226 Difference]: Without dead ends: 660 [2024-11-10 08:57:27,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:57:27,187 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 39 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:57:27,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 478 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:57:27,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-11-10 08:57:27,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 585. [2024-11-10 08:57:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 451 states have (on average 1.3259423503325942) internal successors, (598), 451 states have internal predecessors, (598), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-10 08:57:27,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 850 transitions. [2024-11-10 08:57:27,255 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 850 transitions. Word has length 130 [2024-11-10 08:57:27,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:57:27,257 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 850 transitions. [2024-11-10 08:57:27,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 850 transitions. [2024-11-10 08:57:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 08:57:27,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:57:27,259 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:57:27,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 08:57:27,259 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:57:27,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:57:27,260 INFO L85 PathProgramCache]: Analyzing trace with hash -125048023, now seen corresponding path program 1 times [2024-11-10 08:57:27,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:57:27,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134195888] [2024-11-10 08:57:27,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:57:27,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:57:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 08:57:27,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [281926123] [2024-11-10 08:57:27,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:57:27,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:57:27,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:57:27,355 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-10 08:57:27,356 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-10 08:57:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:27,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 08:57:27,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:57:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-10 08:57:28,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:57:28,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:57:28,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134195888] [2024-11-10 08:57:28,926 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 08:57:28,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281926123] [2024-11-10 08:57:28,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281926123] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:57:28,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 08:57:28,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-10 08:57:28,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527340723] [2024-11-10 08:57:28,927 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 08:57:28,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 08:57:28,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:57:28,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 08:57:28,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-10 08:57:28,929 INFO L87 Difference]: Start difference. First operand 585 states and 850 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 08:57:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:57:29,521 INFO L93 Difference]: Finished difference Result 1427 states and 2031 transitions. [2024-11-10 08:57:29,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 08:57:29,522 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 135 [2024-11-10 08:57:29,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:57:29,527 INFO L225 Difference]: With dead ends: 1427 [2024-11-10 08:57:29,528 INFO L226 Difference]: Without dead ends: 1071 [2024-11-10 08:57:29,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-11-10 08:57:29,530 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 161 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 08:57:29,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 432 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 08:57:29,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-11-10 08:57:29,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1025. [2024-11-10 08:57:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 795 states have (on average 1.3144654088050314) internal successors, (1045), 799 states have internal predecessors, (1045), 206 states have call successors, (206), 23 states have call predecessors, (206), 23 states have return successors, (206), 202 states have call predecessors, (206), 206 states have call successors, (206) [2024-11-10 08:57:29,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1457 transitions. [2024-11-10 08:57:29,616 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1457 transitions. Word has length 135 [2024-11-10 08:57:29,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:57:29,617 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1457 transitions. [2024-11-10 08:57:29,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 08:57:29,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1457 transitions. [2024-11-10 08:57:29,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 08:57:29,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:57:29,619 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:57:29,628 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-10 08:57:29,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:57:29,820 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:57:29,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:57:29,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1652570135, now seen corresponding path program 1 times [2024-11-10 08:57:29,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:57:29,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250601616] [2024-11-10 08:57:29,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:57:29,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:57:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:57:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:57:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:57:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:57:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:57:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:57:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:57:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:57:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:57:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 08:57:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 08:57:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 08:57:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:57:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:57:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:57:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:57:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:57:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:57:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:57:30,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:57:30,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250601616] [2024-11-10 08:57:30,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250601616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:57:30,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:57:30,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:57:30,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075966667] [2024-11-10 08:57:30,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:57:30,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:57:30,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:57:30,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:57:30,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:57:30,065 INFO L87 Difference]: Start difference. First operand 1025 states and 1457 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:30,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:57:30,193 INFO L93 Difference]: Finished difference Result 1763 states and 2533 transitions. [2024-11-10 08:57:30,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:57:30,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 135 [2024-11-10 08:57:30,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:57:30,204 INFO L225 Difference]: With dead ends: 1763 [2024-11-10 08:57:30,204 INFO L226 Difference]: Without dead ends: 1355 [2024-11-10 08:57:30,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:57:30,207 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 70 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:57:30,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 321 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:57:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2024-11-10 08:57:30,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1028. [2024-11-10 08:57:30,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 798 states have (on average 1.31328320802005) internal successors, (1048), 802 states have internal predecessors, (1048), 206 states have call successors, (206), 23 states have call predecessors, (206), 23 states have return successors, (206), 202 states have call predecessors, (206), 206 states have call successors, (206) [2024-11-10 08:57:30,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1460 transitions. [2024-11-10 08:57:30,298 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1460 transitions. Word has length 135 [2024-11-10 08:57:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:57:30,298 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1460 transitions. [2024-11-10 08:57:30,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1460 transitions. [2024-11-10 08:57:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 08:57:30,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:57:30,300 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:57:30,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 08:57:30,301 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:57:30,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:57:30,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2131862984, now seen corresponding path program 1 times [2024-11-10 08:57:30,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:57:30,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346613929] [2024-11-10 08:57:30,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:57:30,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:57:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 08:57:30,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269758709] [2024-11-10 08:57:30,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:57:30,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:57:30,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:57:30,390 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-10 08:57:30,392 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-10 08:57:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:57:30,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:57:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:57:30,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:57:30,871 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:57:30,872 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:57:30,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 08:57:31,074 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,SelfDestructingSolverStorable10 [2024-11-10 08:57:31,077 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:57:31,170 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:57:31,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:57:31 BoogieIcfgContainer [2024-11-10 08:57:31,175 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:57:31,175 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:57:31,175 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:57:31,175 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:57:31,176 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:57:22" (3/4) ... [2024-11-10 08:57:31,178 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:57:31,179 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:57:31,180 INFO L158 Benchmark]: Toolchain (without parser) took 10151.02ms. Allocated memory was 163.6MB in the beginning and 276.8MB in the end (delta: 113.2MB). Free memory was 94.8MB in the beginning and 213.4MB in the end (delta: -118.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:57:31,180 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:57:31,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.04ms. Allocated memory is still 163.6MB. Free memory was 94.5MB in the beginning and 126.9MB in the end (delta: -32.4MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-11-10 08:57:31,181 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.16ms. Allocated memory is still 163.6MB. Free memory was 126.9MB in the beginning and 120.4MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 08:57:31,181 INFO L158 Benchmark]: Boogie Preprocessor took 68.06ms. Allocated memory is still 163.6MB. Free memory was 120.4MB in the beginning and 108.7MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:57:31,181 INFO L158 Benchmark]: IcfgBuilder took 719.06ms. Allocated memory is still 163.6MB. Free memory was 108.7MB in the beginning and 75.2MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-10 08:57:31,182 INFO L158 Benchmark]: TraceAbstraction took 8801.78ms. Allocated memory was 163.6MB in the beginning and 276.8MB in the end (delta: 113.2MB). Free memory was 74.5MB in the beginning and 214.5MB in the end (delta: -140.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:57:31,182 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 276.8MB. Free memory was 214.5MB in the beginning and 213.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:57:31,183 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.16ms. Allocated memory is still 104.9MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.04ms. Allocated memory is still 163.6MB. Free memory was 94.5MB in the beginning and 126.9MB in the end (delta: -32.4MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.16ms. Allocated memory is still 163.6MB. Free memory was 126.9MB in the beginning and 120.4MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.06ms. Allocated memory is still 163.6MB. Free memory was 120.4MB in the beginning and 108.7MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * IcfgBuilder took 719.06ms. Allocated memory is still 163.6MB. Free memory was 108.7MB in the beginning and 75.2MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8801.78ms. Allocated memory was 163.6MB in the beginning and 276.8MB in the end (delta: 113.2MB). Free memory was 74.5MB in the beginning and 214.5MB in the end (delta: -140.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 276.8MB. Free memory was 214.5MB in the beginning and 213.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 119, overapproximation of bitwiseOr at line 119, overapproximation of someBinaryArithmeticDOUBLEoperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char last_1_var_1_3 = 64; [L42] unsigned short int last_1_var_1_6 = 10; [L43] unsigned short int last_1_var_1_15 = 5; [L44] unsigned short int last_1_var_1_20 = 50; [L45] unsigned short int last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L112] last_1_var_1_3 = var_1_3 [L113] last_1_var_1_6 = var_1_6 [L114] last_1_var_1_15 = var_1_15 [L115] last_1_var_1_20 = var_1_20 [L116] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L126] RET updateLastVariables() [L127] CALL updateVariables() [L81] var_1_4 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L83] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L83] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L84] var_1_5 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L86] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L86] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L87] var_1_9 = __VERIFIER_nondet_long() [L88] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L88] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L89] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L89] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L90] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L90] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L91] var_1_10 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L92] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L93] var_1_11 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L94] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L95] var_1_12 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L96] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L97] var_1_13 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L98] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L99] var_1_14 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L100] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L101] var_1_17 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L102] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L103] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L103] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L104] var_1_18 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L105] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L106] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L106] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L107] var_1_19 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L108] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L109] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L109] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L127] RET updateVariables() [L128] CALL step() [L49] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L49] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L50] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=130, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L51] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=130, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L54] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L58] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) [L59] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=-4, var_1_20=140, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L60] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=-4, var_1_20=140, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_8=15/8, var_1_9=132] [L63] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L64] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=-4, var_1_20=140, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_9=132] [L70] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L71] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) [L72] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=1, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=1, var_1_20=140, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_9=132] [L73] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=1, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=1, var_1_20=140, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_9=132] [L73] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L76] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L77] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=270, var_1_16=1, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=1, var_1_20=140, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_9=132] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=270, var_1_16=1, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=1, var_1_20=140, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_9=132] [L119] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=270, var_1_16=1, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=1, var_1_20=140, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_9=132] [L119] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=270, var_1_16=1, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=1, var_1_20=140, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_9=132] [L119] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=270, var_1_16=1, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=1, var_1_20=140, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_9=132] [L119-L120] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=270, var_1_16=1, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=1, var_1_20=140, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_9=132] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=270, var_1_16=1, var_1_17=-30, var_1_18=0, var_1_19=31, var_1_1=1, var_1_20=140, var_1_21=0, var_1_3=64, var_1_4=140, var_1_5=130, var_1_6=10, var_1_9=132] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 11, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 963 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 959 mSDsluCounter, 3574 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2452 mSDsCounter, 291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 873 IncrementalHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 291 mSolverCounterUnsat, 1122 mSDtfsCounter, 873 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 574 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1028occurred in iteration=10, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 712 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1700 NumberOfCodeBlocks, 1700 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1285 ConstructedInterpolants, 0 QuantifiedInterpolants, 4005 SizeOfPredicates, 3 NumberOfNonLiveVariables, 325 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 6078/6120 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-10 08:57:31,213 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_operatoramount_amount50_file-78.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 c60f372b7dc1b4532187e57acf518ccbf786ab918ffb900907557784c73c0567 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:57:33,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:57:33,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:57:33,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:57:33,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:57:33,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:57:33,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:57:33,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:57:33,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:57:33,458 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:57:33,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:57:33,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:57:33,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:57:33,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:57:33,462 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:57:33,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:57:33,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:57:33,462 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:57:33,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:57:33,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:57:33,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:57:33,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:57:33,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:57:33,465 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:57:33,466 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:57:33,466 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:57:33,467 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:57:33,467 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:57:33,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:57:33,467 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:57:33,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:57:33,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:57:33,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:57:33,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:57:33,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:57:33,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:57:33,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:57:33,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:57:33,471 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:57:33,471 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:57:33,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:57:33,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:57:33,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:57:33,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:57:33,472 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 -> c60f372b7dc1b4532187e57acf518ccbf786ab918ffb900907557784c73c0567 [2024-11-10 08:57:33,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:57:33,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:57:33,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:57:33,854 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:57:33,855 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:57:33,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-78.i [2024-11-10 08:57:35,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:57:35,720 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:57:35,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-78.i [2024-11-10 08:57:35,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f15c2cfb8/13abc0571b254e3f87479bee4d7d1d61/FLAGfc3c777fa [2024-11-10 08:57:35,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f15c2cfb8/13abc0571b254e3f87479bee4d7d1d61 [2024-11-10 08:57:35,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:57:35,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:57:35,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:57:35,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:57:35,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:57:35,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:57:35" (1/1) ... [2024-11-10 08:57:35,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120f2c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:35, skipping insertion in model container [2024-11-10 08:57:35,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:57:35" (1/1) ... [2024-11-10 08:57:35,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:57:35,986 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_operatoramount_amount50_file-78.i[915,928] [2024-11-10 08:57:36,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:57:36,087 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:57:36,101 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_operatoramount_amount50_file-78.i[915,928] [2024-11-10 08:57:36,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:57:36,173 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:57:36,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:36 WrapperNode [2024-11-10 08:57:36,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:57:36,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:57:36,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:57:36,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:57:36,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:36" (1/1) ... [2024-11-10 08:57:36,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:36" (1/1) ... [2024-11-10 08:57:36,236 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-11-10 08:57:36,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:57:36,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:57:36,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:57:36,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:57:36,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:36" (1/1) ... [2024-11-10 08:57:36,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:36" (1/1) ... [2024-11-10 08:57:36,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:36" (1/1) ... [2024-11-10 08:57:36,276 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-10 08:57:36,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:36" (1/1) ... [2024-11-10 08:57:36,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:36" (1/1) ... [2024-11-10 08:57:36,291 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:36" (1/1) ... [2024-11-10 08:57:36,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:36" (1/1) ... [2024-11-10 08:57:36,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:36" (1/1) ... [2024-11-10 08:57:36,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:36" (1/1) ... [2024-11-10 08:57:36,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:57:36,301 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:57:36,301 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:57:36,302 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:57:36,304 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:36" (1/1) ... [2024-11-10 08:57:36,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:57:36,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:57:36,341 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-10 08:57:36,345 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-10 08:57:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:57:36,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:57:36,386 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:57:36,386 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:57:36,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:57:36,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:57:36,471 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:57:36,474 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:57:42,058 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 08:57:42,058 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:57:42,072 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:57:42,072 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:57:42,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:57:42 BoogieIcfgContainer [2024-11-10 08:57:42,073 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:57:42,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:57:42,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:57:42,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:57:42,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:57:35" (1/3) ... [2024-11-10 08:57:42,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5232f89d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:57:42, skipping insertion in model container [2024-11-10 08:57:42,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:57:36" (2/3) ... [2024-11-10 08:57:42,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5232f89d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:57:42, skipping insertion in model container [2024-11-10 08:57:42,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:57:42" (3/3) ... [2024-11-10 08:57:42,083 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-78.i [2024-11-10 08:57:42,111 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:57:42,111 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:57:42,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:57:42,177 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;@c3dd1ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:57:42,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:57:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 08:57:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 08:57:42,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:57:42,196 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:57:42,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:57:42,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:57:42,201 INFO L85 PathProgramCache]: Analyzing trace with hash -198739961, now seen corresponding path program 1 times [2024-11-10 08:57:42,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:57:42,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236635164] [2024-11-10 08:57:42,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:57:42,213 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-10 08:57:42,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:57:42,216 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-10 08:57:42,217 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-10 08:57:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:42,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:57:42,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:57:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-10 08:57:42,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:57:42,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:57:42,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236635164] [2024-11-10 08:57:42,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236635164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:57:42,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:57:42,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:57:42,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380117864] [2024-11-10 08:57:42,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:57:42,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:57:42,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:57:42,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:57:42,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:57:42,759 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 08:57:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:57:42,786 INFO L93 Difference]: Finished difference Result 112 states and 185 transitions. [2024-11-10 08:57:42,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:57:42,788 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2024-11-10 08:57:42,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:57:42,795 INFO L225 Difference]: With dead ends: 112 [2024-11-10 08:57:42,795 INFO L226 Difference]: Without dead ends: 55 [2024-11-10 08:57:42,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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-10 08:57:42,804 INFO L432 NwaCegarLoop]: 79 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, 79 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-10 08:57:42,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:57:42,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-10 08:57:42,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-10 08:57:42,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 08:57:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2024-11-10 08:57:42,862 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 119 [2024-11-10 08:57:42,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:57:42,863 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2024-11-10 08:57:42,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 08:57:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2024-11-10 08:57:42,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 08:57:42,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:57:42,870 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:57:42,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 08:57:43,071 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-10 08:57:43,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:57:43,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:57:43,072 INFO L85 PathProgramCache]: Analyzing trace with hash -975176819, now seen corresponding path program 1 times [2024-11-10 08:57:43,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:57:43,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393554398] [2024-11-10 08:57:43,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:57:43,074 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-10 08:57:43,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:57:43,076 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-10 08:57:43,077 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-10 08:57:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:43,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 08:57:43,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:57:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:57:43,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:57:43,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:57:43,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393554398] [2024-11-10 08:57:43,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393554398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:57:43,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:57:43,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:57:43,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711280295] [2024-11-10 08:57:43,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:57:43,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:57:43,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:57:43,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:57:43,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:57:43,593 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:47,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 08:57:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:57:47,357 INFO L93 Difference]: Finished difference Result 107 states and 155 transitions. [2024-11-10 08:57:47,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:57:47,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-10 08:57:47,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:57:47,397 INFO L225 Difference]: With dead ends: 107 [2024-11-10 08:57:47,397 INFO L226 Difference]: Without dead ends: 55 [2024-11-10 08:57:47,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 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-10 08:57:47,399 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-10 08:57:47,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-10 08:57:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-10 08:57:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-10 08:57:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 08:57:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2024-11-10 08:57:47,413 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 119 [2024-11-10 08:57:47,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:57:47,415 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2024-11-10 08:57:47,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:47,415 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2024-11-10 08:57:47,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-10 08:57:47,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:57:47,418 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:57:47,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 08:57:47,618 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-10 08:57:47,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:57:47,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:57:47,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1684000295, now seen corresponding path program 1 times [2024-11-10 08:57:47,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:57:47,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475759141] [2024-11-10 08:57:47,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:57:47,621 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-10 08:57:47,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:57:47,623 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-10 08:57:47,624 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-10 08:57:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:47,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 08:57:47,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:57:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:57:50,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:57:50,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:57:50,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475759141] [2024-11-10 08:57:50,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475759141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:57:50,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:57:50,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:57:50,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308564769] [2024-11-10 08:57:50,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:57:50,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:57:50,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:57:50,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:57:50,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:57:50,335 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:52,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:57:57,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:57:57,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:57:57,087 INFO L93 Difference]: Finished difference Result 175 states and 249 transitions. [2024-11-10 08:57:57,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:57:57,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-10 08:57:57,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:57:57,119 INFO L225 Difference]: With dead ends: 175 [2024-11-10 08:57:57,119 INFO L226 Difference]: Without dead ends: 123 [2024-11-10 08:57:57,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:57:57,121 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 58 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-10 08:57:57,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 269 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 72 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2024-11-10 08:57:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-10 08:57:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2024-11-10 08:57:57,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 67 states have internal predecessors, (80), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 08:57:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2024-11-10 08:57:57,162 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 120 [2024-11-10 08:57:57,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:57:57,163 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2024-11-10 08:57:57,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:57:57,163 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2024-11-10 08:57:57,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-10 08:57:57,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:57:57,165 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:57:57,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 08:57:57,366 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-10 08:57:57,366 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:57:57,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:57:57,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1880513800, now seen corresponding path program 1 times [2024-11-10 08:57:57,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:57:57,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368537348] [2024-11-10 08:57:57,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:57:57,368 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-10 08:57:57,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:57:57,372 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-10 08:57:57,374 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-10 08:57:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:57:57,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 08:57:57,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:58:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:58:00,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:58:00,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:58:00,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368537348] [2024-11-10 08:58:00,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368537348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:58:00,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:58:00,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:58:00,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201436888] [2024-11-10 08:58:00,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:58:00,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:58:00,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:58:00,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:58:00,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:58:00,351 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:58:03,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:58:07,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:58:11,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:58:14,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:58:15,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:58:18,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:58:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:58:18,654 INFO L93 Difference]: Finished difference Result 287 states and 407 transitions. [2024-11-10 08:58:18,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 08:58:18,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-10 08:58:18,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:58:18,686 INFO L225 Difference]: With dead ends: 287 [2024-11-10 08:58:18,686 INFO L226 Difference]: Without dead ends: 235 [2024-11-10 08:58:18,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-10 08:58:18,688 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 146 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:58:18,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 268 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 18.1s Time] [2024-11-10 08:58:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-10 08:58:18,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 195. [2024-11-10 08:58:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 118 states have internal predecessors, (138), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-10 08:58:18,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 282 transitions. [2024-11-10 08:58:18,757 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 282 transitions. Word has length 120 [2024-11-10 08:58:18,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:58:18,757 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 282 transitions. [2024-11-10 08:58:18,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:58:18,758 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 282 transitions. [2024-11-10 08:58:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-10 08:58:18,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:58:18,760 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:58:18,779 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-10 08:58:18,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:58:18,961 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:58:18,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:58:18,961 INFO L85 PathProgramCache]: Analyzing trace with hash -993010119, now seen corresponding path program 1 times [2024-11-10 08:58:18,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:58:18,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836268666] [2024-11-10 08:58:18,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:58:18,962 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-10 08:58:18,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:58:18,965 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:58:18,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 08:58:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:58:19,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 08:58:19,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:58:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-10 08:58:21,039 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:58:23,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:58:23,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836268666] [2024-11-10 08:58:23,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836268666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:58:23,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1362987078] [2024-11-10 08:58:23,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:58:23,686 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 08:58:23,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 08:58:23,689 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 08:58:23,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-10 08:58:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:58:24,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 08:58:24,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:58:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:58:25,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:58:25,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1362987078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:58:25,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 08:58:25,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-10 08:58:25,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957287200] [2024-11-10 08:58:25,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:58:25,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:58:25,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:58:25,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:58:25,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-10 08:58:25,558 INFO L87 Difference]: Start difference. First operand 195 states and 282 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:58:28,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:58:32,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:58:34,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:58:38,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:58:38,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:58:38,458 INFO L93 Difference]: Finished difference Result 395 states and 561 transitions. [2024-11-10 08:58:38,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:58:38,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-10 08:58:38,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:58:38,462 INFO L225 Difference]: With dead ends: 395 [2024-11-10 08:58:38,462 INFO L226 Difference]: Without dead ends: 294 [2024-11-10 08:58:38,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-10 08:58:38,464 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 46 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2024-11-10 08:58:38,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 204 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 2 Unknown, 0 Unchecked, 12.9s Time] [2024-11-10 08:58:38,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-10 08:58:38,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 286. [2024-11-10 08:58:38,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 183 states have (on average 1.1912568306010929) internal successors, (218), 185 states have internal predecessors, (218), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-10 08:58:38,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 406 transitions. [2024-11-10 08:58:38,513 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 406 transitions. Word has length 120 [2024-11-10 08:58:38,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:58:38,514 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 406 transitions. [2024-11-10 08:58:38,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:58:38,514 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 406 transitions. [2024-11-10 08:58:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-10 08:58:38,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:58:38,516 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:58:38,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-10 08:58:38,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 08:58:38,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:58:38,917 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:58:38,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:58:38,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1751431081, now seen corresponding path program 1 times [2024-11-10 08:58:38,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:58:38,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284680246] [2024-11-10 08:58:38,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:58:38,918 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-10 08:58:38,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:58:38,921 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:58:38,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 08:58:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:58:39,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 08:58:39,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:58:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:58:40,758 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:58:40,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:58:40,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284680246] [2024-11-10 08:58:40,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284680246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:58:40,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:58:40,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:58:40,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200071725] [2024-11-10 08:58:40,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:58:40,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:58:40,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:58:40,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:58:40,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:58:40,760 INFO L87 Difference]: Start difference. First operand 286 states and 406 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:58:43,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []