./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.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 1826fac0aaf6beb599525d92da03802aca3a315a8be49017dad700e98d033a28 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:41:54,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:41:54,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:41:54,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:41:54,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:41:54,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:41:54,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:41:54,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:41:54,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:41:54,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:41:54,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:41:54,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:41:54,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:41:54,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:41:54,141 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:41:54,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:41:54,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:41:54,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:41:54,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:41:54,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:41:54,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:41:54,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:41:54,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:41:54,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:41:54,145 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:41:54,145 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:41:54,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:41:54,145 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:41:54,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:41:54,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:41:54,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:41:54,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:41:54,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:41:54,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:41:54,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:41:54,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:41:54,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:41:54,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:41:54,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:41:54,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:41:54,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:41:54,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:41:54,148 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 -> 1826fac0aaf6beb599525d92da03802aca3a315a8be49017dad700e98d033a28 [2024-11-08 21:41:54,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:41:54,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:41:54,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:41:54,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:41:54,364 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:41:54,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-11-08 21:41:55,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:41:55,696 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:41:55,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-11-08 21:41:55,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09b5d0175/150460e45e0b4d888d46c8413ec83407/FLAG46156cfb2 [2024-11-08 21:41:56,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09b5d0175/150460e45e0b4d888d46c8413ec83407 [2024-11-08 21:41:56,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:41:56,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:41:56,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:41:56,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:41:56,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:41:56,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:41:56" (1/1) ... [2024-11-08 21:41:56,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b31ba9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:56, skipping insertion in model container [2024-11-08 21:41:56,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:41:56" (1/1) ... [2024-11-08 21:41:56,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:41:56,271 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_fillercode_fillercodestructure_filler-pr-ci_file-36.i[919,932] [2024-11-08 21:41:56,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:41:56,362 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:41:56,371 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_fillercode_fillercodestructure_filler-pr-ci_file-36.i[919,932] [2024-11-08 21:41:56,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:41:56,426 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:41:56,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:56 WrapperNode [2024-11-08 21:41:56,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:41:56,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:41:56,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:41:56,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:41:56,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:56" (1/1) ... [2024-11-08 21:41:56,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:56" (1/1) ... [2024-11-08 21:41:56,470 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 231 [2024-11-08 21:41:56,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:41:56,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:41:56,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:41:56,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:41:56,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:56" (1/1) ... [2024-11-08 21:41:56,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:56" (1/1) ... [2024-11-08 21:41:56,483 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:56" (1/1) ... [2024-11-08 21:41:56,501 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:41:56,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:56" (1/1) ... [2024-11-08 21:41:56,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:56" (1/1) ... [2024-11-08 21:41:56,512 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:56" (1/1) ... [2024-11-08 21:41:56,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:56" (1/1) ... [2024-11-08 21:41:56,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:56" (1/1) ... [2024-11-08 21:41:56,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:56" (1/1) ... [2024-11-08 21:41:56,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:41:56,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:41:56,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:41:56,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:41:56,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:56" (1/1) ... [2024-11-08 21:41:56,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:41:56,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:41:56,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:41:56,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:41:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:41:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:41:56,591 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:41:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:41:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:41:56,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:41:56,674 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:41:56,677 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:41:57,011 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 21:41:57,011 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:41:57,025 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:41:57,026 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:41:57,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:41:57 BoogieIcfgContainer [2024-11-08 21:41:57,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:41:57,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:41:57,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:41:57,031 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:41:57,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:41:56" (1/3) ... [2024-11-08 21:41:57,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b16d94d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:41:57, skipping insertion in model container [2024-11-08 21:41:57,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:56" (2/3) ... [2024-11-08 21:41:57,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b16d94d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:41:57, skipping insertion in model container [2024-11-08 21:41:57,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:41:57" (3/3) ... [2024-11-08 21:41:57,034 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-11-08 21:41:57,048 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:41:57,049 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:41:57,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:41:57,109 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;@27b33841, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:41:57,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:41:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 21:41:57,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 21:41:57,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:57,128 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:57,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:57,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:57,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2011954659, now seen corresponding path program 1 times [2024-11-08 21:41:57,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:57,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714663110] [2024-11-08 21:41:57,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:57,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:41:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:41:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:41:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 21:41:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 21:41:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:41:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 21:41:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:41:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 21:41:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:41:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 21:41:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 21:41:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 21:41:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 21:41:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 21:41:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 21:41:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 21:41:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 21:41:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:41:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 21:41:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:41:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 21:41:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 21:41:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-08 21:41:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 21:41:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:41:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-08 21:41:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-08 21:41:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-08 21:41:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:41:57,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:57,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714663110] [2024-11-08 21:41:57,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714663110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:57,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:57,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:41:57,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413476966] [2024-11-08 21:41:57,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:57,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:41:57,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:57,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:41:57,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:41:57,700 INFO L87 Difference]: Start difference. First operand has 102 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 21:41:57,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:57,730 INFO L93 Difference]: Finished difference Result 197 states and 346 transitions. [2024-11-08 21:41:57,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:41:57,734 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 209 [2024-11-08 21:41:57,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:57,742 INFO L225 Difference]: With dead ends: 197 [2024-11-08 21:41:57,742 INFO L226 Difference]: Without dead ends: 98 [2024-11-08 21:41:57,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:41:57,747 INFO L432 NwaCegarLoop]: 152 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, 152 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:57,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:41:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-08 21:41:57,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-08 21:41:57,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 21:41:57,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 152 transitions. [2024-11-08 21:41:57,788 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 152 transitions. Word has length 209 [2024-11-08 21:41:57,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:57,788 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 152 transitions. [2024-11-08 21:41:57,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 21:41:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 152 transitions. [2024-11-08 21:41:57,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 21:41:57,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:57,792 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:57,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:41:57,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:57,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:57,793 INFO L85 PathProgramCache]: Analyzing trace with hash 503394599, now seen corresponding path program 1 times [2024-11-08 21:41:57,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:57,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991768058] [2024-11-08 21:41:57,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:57,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:41:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:41:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:41:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 21:41:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 21:41:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:41:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 21:41:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:41:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 21:41:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:41:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 21:41:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 21:41:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 21:41:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 21:41:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 21:41:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 21:41:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 21:41:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 21:41:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:41:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 21:41:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:41:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 21:41:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 21:41:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-08 21:41:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 21:41:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:41:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-08 21:41:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-08 21:41:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-08 21:41:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:41:58,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:58,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991768058] [2024-11-08 21:41:58,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991768058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:58,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:58,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:41:58,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705649050] [2024-11-08 21:41:58,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:58,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:41:58,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:58,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:41:58,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:41:58,116 INFO L87 Difference]: Start difference. First operand 98 states and 152 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:41:58,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:58,172 INFO L93 Difference]: Finished difference Result 230 states and 359 transitions. [2024-11-08 21:41:58,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:41:58,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2024-11-08 21:41:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:58,175 INFO L225 Difference]: With dead ends: 230 [2024-11-08 21:41:58,175 INFO L226 Difference]: Without dead ends: 135 [2024-11-08 21:41:58,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:41:58,177 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 55 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:58,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 278 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:41:58,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-08 21:41:58,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 127. [2024-11-08 21:41:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 93 states have internal predecessors, (133), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 21:41:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 197 transitions. [2024-11-08 21:41:58,193 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 197 transitions. Word has length 209 [2024-11-08 21:41:58,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:58,195 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 197 transitions. [2024-11-08 21:41:58,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:41:58,196 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 197 transitions. [2024-11-08 21:41:58,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 21:41:58,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:58,200 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:58,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:41:58,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:58,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:58,201 INFO L85 PathProgramCache]: Analyzing trace with hash 284539881, now seen corresponding path program 1 times [2024-11-08 21:41:58,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:58,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925445979] [2024-11-08 21:41:58,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:58,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:41:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:41:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:41:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 21:41:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 21:41:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:41:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 21:41:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:41:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 21:41:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:41:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 21:41:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 21:41:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 21:41:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 21:41:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 21:41:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 21:41:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 21:41:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 21:41:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:41:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 21:41:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:41:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 21:41:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 21:41:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-08 21:41:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 21:41:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:41:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-08 21:41:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-08 21:41:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-08 21:41:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:41:58,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:58,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925445979] [2024-11-08 21:41:58,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925445979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:58,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:58,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:41:58,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613638244] [2024-11-08 21:41:58,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:58,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:41:58,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:58,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:41:58,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:41:58,447 INFO L87 Difference]: Start difference. First operand 127 states and 197 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:41:58,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:58,518 INFO L93 Difference]: Finished difference Result 319 states and 496 transitions. [2024-11-08 21:41:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:41:58,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2024-11-08 21:41:58,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:58,522 INFO L225 Difference]: With dead ends: 319 [2024-11-08 21:41:58,522 INFO L226 Difference]: Without dead ends: 195 [2024-11-08 21:41:58,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:41:58,527 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 76 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:58,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 289 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:41:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-08 21:41:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2024-11-08 21:41:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 146 states have (on average 1.452054794520548) internal successors, (212), 147 states have internal predecessors, (212), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-08 21:41:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 298 transitions. [2024-11-08 21:41:58,554 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 298 transitions. Word has length 209 [2024-11-08 21:41:58,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:58,555 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 298 transitions. [2024-11-08 21:41:58,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:41:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 298 transitions. [2024-11-08 21:41:58,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 21:41:58,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:58,560 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:58,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:41:58,561 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:58,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:58,561 INFO L85 PathProgramCache]: Analyzing trace with hash 406873693, now seen corresponding path program 1 times [2024-11-08 21:41:58,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:58,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384770738] [2024-11-08 21:41:58,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:58,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:41:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:41:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:41:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 21:41:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 21:41:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:41:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 21:41:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:41:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 21:41:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:41:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 21:41:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 21:41:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 21:41:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 21:41:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 21:41:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 21:41:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 21:41:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 21:41:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:41:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 21:41:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:41:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 21:41:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 21:41:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-08 21:41:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 21:41:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:41:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-08 21:41:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-08 21:41:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-08 21:41:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-08 21:41:59,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:59,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384770738] [2024-11-08 21:41:59,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384770738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:41:59,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142571137] [2024-11-08 21:41:59,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:59,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:41:59,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:41:59,177 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:41:59,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 21:41:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:59,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 21:41:59,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:41:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1321 proven. 66 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2024-11-08 21:41:59,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:42:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-08 21:42:00,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142571137] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:42:00,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:42:00,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2024-11-08 21:42:00,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116088172] [2024-11-08 21:42:00,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:42:00,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 21:42:00,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:42:00,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 21:42:00,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-08 21:42:00,102 INFO L87 Difference]: Start difference. First operand 192 states and 298 transitions. Second operand has 16 states, 16 states have (on average 7.875) internal successors, (126), 16 states have internal predecessors, (126), 6 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) [2024-11-08 21:42:01,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:42:01,114 INFO L93 Difference]: Finished difference Result 606 states and 915 transitions. [2024-11-08 21:42:01,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 21:42:01,115 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.875) internal successors, (126), 16 states have internal predecessors, (126), 6 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) Word has length 210 [2024-11-08 21:42:01,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:42:01,118 INFO L225 Difference]: With dead ends: 606 [2024-11-08 21:42:01,118 INFO L226 Difference]: Without dead ends: 417 [2024-11-08 21:42:01,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=1091, Unknown=0, NotChecked=0, Total=1482 [2024-11-08 21:42:01,120 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 498 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 21:42:01,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 690 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 21:42:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-08 21:42:01,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 364. [2024-11-08 21:42:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 297 states have (on average 1.4478114478114479) internal successors, (430), 300 states have internal predecessors, (430), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-08 21:42:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 544 transitions. [2024-11-08 21:42:01,155 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 544 transitions. Word has length 210 [2024-11-08 21:42:01,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:42:01,156 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 544 transitions. [2024-11-08 21:42:01,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.875) internal successors, (126), 16 states have internal predecessors, (126), 6 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) [2024-11-08 21:42:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 544 transitions. [2024-11-08 21:42:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 21:42:01,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:42:01,159 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:42:01,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 21:42:01,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:42:01,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:42:01,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:42:01,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1329105575, now seen corresponding path program 1 times [2024-11-08 21:42:01,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:42:01,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170364545] [2024-11-08 21:42:01,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:42:01,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:42:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:42:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:42:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:42:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:42:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:42:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:42:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 21:42:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 21:42:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:42:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 21:42:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:42:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 21:42:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:42:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 21:42:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 21:42:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 21:42:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 21:42:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 21:42:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 21:42:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 21:42:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 21:42:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:42:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 21:42:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:42:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 21:42:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 21:42:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-08 21:42:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 21:42:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:42:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-08 21:42:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-08 21:42:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-08 21:42:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-08 21:42:01,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:42:01,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170364545] [2024-11-08 21:42:01,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170364545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:42:01,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950565499] [2024-11-08 21:42:01,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:42:01,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:42:01,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:42:01,698 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:42:01,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 21:42:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:01,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 21:42:01,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:42:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 717 proven. 72 refuted. 0 times theorem prover too weak. 1195 trivial. 0 not checked. [2024-11-08 21:42:02,105 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:42:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-08 21:42:02,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950565499] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:42:02,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:42:02,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-08 21:42:02,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488040626] [2024-11-08 21:42:02,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:42:02,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 21:42:02,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:42:02,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 21:42:02,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 21:42:02,334 INFO L87 Difference]: Start difference. First operand 364 states and 544 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 3 states have call successors, (80), 2 states have call predecessors, (80), 4 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) [2024-11-08 21:42:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:42:02,825 INFO L93 Difference]: Finished difference Result 782 states and 1138 transitions. [2024-11-08 21:42:02,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 21:42:02,826 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 3 states have call successors, (80), 2 states have call predecessors, (80), 4 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) Word has length 210 [2024-11-08 21:42:02,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:42:02,828 INFO L225 Difference]: With dead ends: 782 [2024-11-08 21:42:02,828 INFO L226 Difference]: Without dead ends: 421 [2024-11-08 21:42:02,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2024-11-08 21:42:02,830 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 298 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:42:02,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 441 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 21:42:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-08 21:42:02,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 303. [2024-11-08 21:42:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 241 states have (on average 1.3817427385892116) internal successors, (333), 243 states have internal predecessors, (333), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 21:42:02,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 433 transitions. [2024-11-08 21:42:02,854 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 433 transitions. Word has length 210 [2024-11-08 21:42:02,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:42:02,855 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 433 transitions. [2024-11-08 21:42:02,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 3 states have call successors, (80), 2 states have call predecessors, (80), 4 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) [2024-11-08 21:42:02,856 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 433 transitions. [2024-11-08 21:42:02,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 21:42:02,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:42:02,858 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:42:02,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 21:42:03,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:42:03,062 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:42:03,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:42:03,062 INFO L85 PathProgramCache]: Analyzing trace with hash -590267408, now seen corresponding path program 1 times [2024-11-08 21:42:03,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:42:03,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44216417] [2024-11-08 21:42:03,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:42:03,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:42:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:42:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:42:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:42:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:42:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:42:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:42:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 21:42:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 21:42:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:42:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 21:42:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:42:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 21:42:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:42:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 21:42:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 21:42:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 21:42:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 21:42:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 21:42:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 21:42:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 21:42:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 21:42:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:42:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 21:42:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:42:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 21:42:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 21:42:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-08 21:42:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 21:42:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:42:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-08 21:42:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-08 21:42:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-08 21:42:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:42:03,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:42:03,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44216417] [2024-11-08 21:42:03,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44216417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:42:03,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:42:03,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:42:03,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367977396] [2024-11-08 21:42:03,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:42:03,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:42:03,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:42:03,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:42:03,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:42:03,250 INFO L87 Difference]: Start difference. First operand 303 states and 433 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:42:03,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:42:03,461 INFO L93 Difference]: Finished difference Result 721 states and 1024 transitions. [2024-11-08 21:42:03,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 21:42:03,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-11-08 21:42:03,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:42:03,464 INFO L225 Difference]: With dead ends: 721 [2024-11-08 21:42:03,464 INFO L226 Difference]: Without dead ends: 421 [2024-11-08 21:42:03,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 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-08 21:42:03,465 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 138 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:42:03,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 463 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:42:03,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-08 21:42:03,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 319. [2024-11-08 21:42:03,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 257 states have (on average 1.4007782101167314) internal successors, (360), 259 states have internal predecessors, (360), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 21:42:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 460 transitions. [2024-11-08 21:42:03,483 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 460 transitions. Word has length 211 [2024-11-08 21:42:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:42:03,484 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 460 transitions. [2024-11-08 21:42:03,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:42:03,484 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 460 transitions. [2024-11-08 21:42:03,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 21:42:03,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:42:03,486 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:42:03,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 21:42:03,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:42:03,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:42:03,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1206639012, now seen corresponding path program 1 times [2024-11-08 21:42:03,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:42:03,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220921265] [2024-11-08 21:42:03,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:42:03,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:42:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:42:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:42:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:42:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:42:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:42:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:42:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 21:42:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 21:42:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:42:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 21:42:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:42:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 21:42:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:42:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 21:42:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 21:42:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 21:42:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 21:42:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 21:42:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 21:42:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 21:42:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 21:42:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:42:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 21:42:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:42:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 21:42:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 21:42:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-08 21:42:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 21:42:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:42:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-08 21:42:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-08 21:42:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-08 21:42:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:42:03,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:42:03,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220921265] [2024-11-08 21:42:03,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220921265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:42:03,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:42:03,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:42:03,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715605054] [2024-11-08 21:42:03,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:42:03,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:42:03,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:42:03,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:42:03,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:42:03,621 INFO L87 Difference]: Start difference. First operand 319 states and 460 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:42:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:42:03,692 INFO L93 Difference]: Finished difference Result 686 states and 987 transitions. [2024-11-08 21:42:03,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:42:03,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-11-08 21:42:03,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:42:03,696 INFO L225 Difference]: With dead ends: 686 [2024-11-08 21:42:03,697 INFO L226 Difference]: Without dead ends: 360 [2024-11-08 21:42:03,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:42:03,698 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 59 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:42:03,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 259 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:42:03,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-08 21:42:03,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 287. [2024-11-08 21:42:03,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 232 states have (on average 1.3836206896551724) internal successors, (321), 233 states have internal predecessors, (321), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-08 21:42:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 407 transitions. [2024-11-08 21:42:03,729 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 407 transitions. Word has length 211 [2024-11-08 21:42:03,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:42:03,730 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 407 transitions. [2024-11-08 21:42:03,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:42:03,731 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 407 transitions. [2024-11-08 21:42:03,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 21:42:03,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:42:03,733 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:42:03,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 21:42:03,733 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:42:03,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:42:03,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1873866515, now seen corresponding path program 1 times [2024-11-08 21:42:03,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:42:03,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75746804] [2024-11-08 21:42:03,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:42:03,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:42:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:42:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:42:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:42:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:42:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:42:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:42:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 21:42:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 21:42:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:42:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 21:42:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:42:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 21:42:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:42:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 21:42:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 21:42:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 21:42:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 21:42:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 21:42:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 21:42:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 21:42:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 21:42:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:42:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 21:42:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:42:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 21:42:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 21:42:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-08 21:42:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 21:42:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:42:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-08 21:42:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-08 21:42:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-08 21:42:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:42:03,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:42:03,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75746804] [2024-11-08 21:42:03,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75746804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:42:03,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:42:03,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:42:03,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452011576] [2024-11-08 21:42:03,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:42:03,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:42:03,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:42:03,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:42:03,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:42:03,995 INFO L87 Difference]: Start difference. First operand 287 states and 407 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:42:04,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:42:04,044 INFO L93 Difference]: Finished difference Result 572 states and 813 transitions. [2024-11-08 21:42:04,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:42:04,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-11-08 21:42:04,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:42:04,047 INFO L225 Difference]: With dead ends: 572 [2024-11-08 21:42:04,047 INFO L226 Difference]: Without dead ends: 288 [2024-11-08 21:42:04,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:42:04,050 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:42:04,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 271 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:42:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-08 21:42:04,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-11-08 21:42:04,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 233 states have (on average 1.3690987124463518) internal successors, (319), 234 states have internal predecessors, (319), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-08 21:42:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 405 transitions. [2024-11-08 21:42:04,068 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 405 transitions. Word has length 211 [2024-11-08 21:42:04,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:42:04,068 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 405 transitions. [2024-11-08 21:42:04,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:42:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 405 transitions. [2024-11-08 21:42:04,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 21:42:04,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:42:04,071 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:42:04,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 21:42:04,071 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:42:04,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:42:04,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1353980623, now seen corresponding path program 1 times [2024-11-08 21:42:04,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:42:04,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886723371] [2024-11-08 21:42:04,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:42:04,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:42:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:42:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:42:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:42:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:42:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:42:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:42:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 21:42:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 21:42:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:42:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 21:42:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:42:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 21:42:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:42:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 21:42:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 21:42:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 21:42:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 21:42:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 21:42:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 21:42:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 21:42:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 21:42:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:42:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 21:42:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:42:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 21:42:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 21:42:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-08 21:42:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 21:42:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:42:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-08 21:42:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-08 21:42:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-08 21:42:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-08 21:42:04,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:42:04,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886723371] [2024-11-08 21:42:04,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886723371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:42:04,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609351563] [2024-11-08 21:42:04,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:42:04,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:42:04,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:42:04,346 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:42:04,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 21:42:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:04,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 21:42:04,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:42:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 841 proven. 66 refuted. 0 times theorem prover too weak. 1077 trivial. 0 not checked. [2024-11-08 21:42:04,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:42:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-08 21:42:04,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609351563] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:42:04,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:42:04,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-08 21:42:04,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603615364] [2024-11-08 21:42:04,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:42:04,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 21:42:04,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:42:04,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 21:42:04,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:42:04,880 INFO L87 Difference]: Start difference. First operand 288 states and 405 transitions. Second operand has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 3 states have call predecessors, (77), 3 states have call successors, (77) [2024-11-08 21:42:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:42:05,310 INFO L93 Difference]: Finished difference Result 693 states and 948 transitions. [2024-11-08 21:42:05,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 21:42:05,310 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 3 states have call predecessors, (77), 3 states have call successors, (77) Word has length 212 [2024-11-08 21:42:05,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:42:05,312 INFO L225 Difference]: With dead ends: 693 [2024-11-08 21:42:05,312 INFO L226 Difference]: Without dead ends: 408 [2024-11-08 21:42:05,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2024-11-08 21:42:05,314 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 220 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:42:05,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 399 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:42:05,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-08 21:42:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 288. [2024-11-08 21:42:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 233 states have (on average 1.3605150214592274) internal successors, (317), 234 states have internal predecessors, (317), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-08 21:42:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 403 transitions. [2024-11-08 21:42:05,337 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 403 transitions. Word has length 212 [2024-11-08 21:42:05,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:42:05,337 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 403 transitions. [2024-11-08 21:42:05,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 3 states have call predecessors, (77), 3 states have call successors, (77) [2024-11-08 21:42:05,338 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 403 transitions. [2024-11-08 21:42:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 21:42:05,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:42:05,339 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:42:05,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 21:42:05,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:42:05,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:42:05,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:42:05,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1280933696, now seen corresponding path program 1 times [2024-11-08 21:42:05,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:42:05,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549235030] [2024-11-08 21:42:05,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:42:05,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:42:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:42:05,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [838259488] [2024-11-08 21:42:05,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:42:05,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:42:05,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:42:05,591 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:42:05,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 21:42:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:42:05,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:42:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:42:05,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:42:05,914 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:42:05,915 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:42:05,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 21:42:06,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:42:06,120 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:42:06,221 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:42:06,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:42:06 BoogieIcfgContainer [2024-11-08 21:42:06,224 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:42:06,225 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:42:06,225 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:42:06,225 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:42:06,225 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:41:57" (3/4) ... [2024-11-08 21:42:06,228 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:42:06,229 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:42:06,229 INFO L158 Benchmark]: Toolchain (without parser) took 10134.38ms. Allocated memory was 117.4MB in the beginning and 272.6MB in the end (delta: 155.2MB). Free memory was 48.2MB in the beginning and 141.2MB in the end (delta: -93.0MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2024-11-08 21:42:06,229 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:42:06,229 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.30ms. Allocated memory was 117.4MB in the beginning and 157.3MB in the end (delta: 39.8MB). Free memory was 48.0MB in the beginning and 117.2MB in the end (delta: -69.2MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2024-11-08 21:42:06,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.05ms. Allocated memory is still 157.3MB. Free memory was 117.2MB in the beginning and 111.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 21:42:06,230 INFO L158 Benchmark]: Boogie Preprocessor took 54.72ms. Allocated memory is still 157.3MB. Free memory was 111.9MB in the beginning and 106.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 21:42:06,230 INFO L158 Benchmark]: RCFGBuilder took 500.03ms. Allocated memory is still 157.3MB. Free memory was 106.7MB in the beginning and 77.3MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 21:42:06,230 INFO L158 Benchmark]: TraceAbstraction took 9196.09ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 76.3MB in the beginning and 141.2MB in the end (delta: -65.0MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2024-11-08 21:42:06,230 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 272.6MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:42:06,231 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.30ms. Allocated memory was 117.4MB in the beginning and 157.3MB in the end (delta: 39.8MB). Free memory was 48.0MB in the beginning and 117.2MB in the end (delta: -69.2MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.05ms. Allocated memory is still 157.3MB. Free memory was 117.2MB in the beginning and 111.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.72ms. Allocated memory is still 157.3MB. Free memory was 111.9MB in the beginning and 106.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 500.03ms. Allocated memory is still 157.3MB. Free memory was 106.7MB in the beginning and 77.3MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9196.09ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 76.3MB in the beginning and 141.2MB in the end (delta: -65.0MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 272.6MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 190, overapproximation of shiftRight at line 115, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of someUnaryDOUBLEoperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 190. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.75; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 9.6; [L25] double var_1_4 = 7.625; [L26] double var_1_5 = 1.5; [L27] double var_1_6 = 63.17; [L28] double var_1_7 = 15.5; [L29] unsigned short int var_1_8 = 4; [L30] unsigned short int var_1_9 = 45624; [L31] unsigned short int var_1_10 = 39447; [L32] unsigned short int var_1_11 = 10; [L33] double var_1_12 = 255.5; [L34] double var_1_13 = 0.0; [L35] double var_1_14 = 127.5; [L36] float var_1_15 = 8.2; [L37] float var_1_16 = 2.8; [L38] signed short int var_1_17 = 8; [L39] double var_1_18 = 24.8; [L40] signed short int var_1_19 = -256; [L41] signed short int var_1_20 = 8; [L42] signed short int var_1_21 = 16; [L43] unsigned short int var_1_22 = 2; [L44] unsigned short int var_1_24 = 16; [L45] unsigned char var_1_25 = 0; [L46] unsigned short int var_1_26 = 1; [L47] double var_1_28 = 199.6; [L48] signed char var_1_33 = 5; [L49] signed char var_1_35 = -1; [L50] double var_1_36 = 0.6; [L51] double var_1_39 = 16.5; [L52] double var_1_40 = 0.2; [L53] float var_1_41 = 31.45; [L54] signed short int var_1_43 = -10; [L55] unsigned long int var_1_44 = 25; [L56] signed short int var_1_45 = 24450; [L57] unsigned long int var_1_46 = 8; [L58] signed short int var_1_47 = -4; [L59] unsigned short int last_1_var_1_22 = 2; VAL [isInitial=0, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L194] isInitial = 1 [L195] FCALL initially() [L196] COND TRUE 1 [L197] CALL updateLastVariables() [L187] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L197] RET updateLastVariables() [L198] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L134] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L135] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L135] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L136] var_1_3 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L137] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L138] var_1_4 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L139] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L140] var_1_5 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L141] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L142] var_1_6 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L143] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L144] var_1_7 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=45624] [L145] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=45624] [L146] var_1_9 = __VERIFIER_nondet_ushort() [L147] CALL assume_abort_if_not(var_1_9 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L147] RET assume_abort_if_not(var_1_9 >= 32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L148] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L148] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L149] var_1_10 = __VERIFIER_nondet_ushort() [L150] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L150] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L151] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L151] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L152] var_1_11 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L153] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L154] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L154] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L155] var_1_13 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L156] RET assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L157] var_1_18 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L158] RET assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L159] CALL assume_abort_if_not(var_1_18 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L159] RET assume_abort_if_not(var_1_18 != 0.0F) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L160] var_1_19 = __VERIFIER_nondet_short() [L161] CALL assume_abort_if_not(var_1_19 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L161] RET assume_abort_if_not(var_1_19 >= -32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L162] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L162] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L163] var_1_20 = __VERIFIER_nondet_short() [L164] CALL assume_abort_if_not(var_1_20 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L164] RET assume_abort_if_not(var_1_20 >= -1) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L165] CALL assume_abort_if_not(var_1_20 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L165] RET assume_abort_if_not(var_1_20 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L166] var_1_21 = __VERIFIER_nondet_short() [L167] CALL assume_abort_if_not(var_1_21 >= -32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L167] RET assume_abort_if_not(var_1_21 >= -32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L168] CALL assume_abort_if_not(var_1_21 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L168] RET assume_abort_if_not(var_1_21 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L169] var_1_25 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L170] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L171] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L171] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L172] var_1_35 = __VERIFIER_nondet_char() [L173] CALL assume_abort_if_not(var_1_35 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L173] RET assume_abort_if_not(var_1_35 >= -127) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L174] CALL assume_abort_if_not(var_1_35 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L174] RET assume_abort_if_not(var_1_35 <= 126) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L175] var_1_39 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_39 >= -461168.6018427382800e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 4611686.018427382800e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L176] RET assume_abort_if_not((var_1_39 >= -461168.6018427382800e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 4611686.018427382800e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L177] var_1_40 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_40 >= -461168.6018427382800e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 4611686.018427382800e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L178] RET assume_abort_if_not((var_1_40 >= -461168.6018427382800e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 4611686.018427382800e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L179] var_1_44 = __VERIFIER_nondet_ulong() [L180] CALL assume_abort_if_not(var_1_44 >= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L180] RET assume_abort_if_not(var_1_44 >= 16) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L181] CALL assume_abort_if_not(var_1_44 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L181] RET assume_abort_if_not(var_1_44 <= 32) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L182] var_1_45 = __VERIFIER_nondet_short() [L183] CALL assume_abort_if_not(var_1_45 >= 16382) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L183] RET assume_abort_if_not(var_1_45 >= 16382) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L184] CALL assume_abort_if_not(var_1_45 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L184] RET assume_abort_if_not(var_1_45 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L198] RET updateVariables() [L199] CALL step() [L63] COND TRUE \read(var_1_2) [L64] var_1_1 = (((((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) < (var_1_7)) ? ((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) : (var_1_7))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=4, var_1_9=32767] [L66] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L67] COND TRUE \read(var_1_2) [L68] var_1_12 = (((((var_1_3 - (var_1_13 - 128.68))) < (var_1_7)) ? ((var_1_3 - (var_1_13 - 128.68))) : (var_1_7))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L70] COND TRUE \read(var_1_2) [L71] var_1_33 = var_1_35 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L73] COND TRUE var_1_3 >= var_1_6 [L74] var_1_46 = ((((var_1_10) > (4u)) ? (var_1_10) : (4u))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L76] var_1_14 = var_1_6 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L77] COND FALSE !(var_1_11 > var_1_10) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L80] COND TRUE var_1_11 != var_1_9 [L81] var_1_36 = ((((99999.5) < 0 ) ? -(99999.5) : (99999.5))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L84] COND FALSE !(var_1_11 < (((((var_1_11) < (var_1_20)) ? (var_1_11) : (var_1_20))) / var_1_9)) [L87] var_1_41 = ((((var_1_40) < 0 ) ? -(var_1_40) : (var_1_40))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L89] COND FALSE !(var_1_13 >= var_1_14) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L96] COND TRUE var_1_3 <= var_1_4 [L97] var_1_16 = ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L99] var_1_26 = var_1_9 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L100] EXPR var_1_11 ^ 8 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L100] COND FALSE !(((var_1_11 ^ 8) * var_1_10) <= var_1_21) [L103] unsigned short int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=65536, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L104] COND FALSE !(var_1_7 >= (var_1_5 / ((((var_1_13) < (var_1_18)) ? (var_1_13) : (var_1_18))))) [L113] var_1_17 = var_1_21 VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=65536, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L115] EXPR ((((var_1_10) < (var_1_9)) ? (var_1_10) : (var_1_9))) >> (var_1_44 - 4u) VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=65536, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L115] COND FALSE !((((((var_1_10) < (var_1_9)) ? (var_1_10) : (var_1_9))) >> (var_1_44 - 4u)) >= var_1_9) [L118] COND TRUE ((((((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35)))) > (var_1_10)) ? (((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35)))) : (var_1_10))) > var_1_9 [L119] var_1_43 = 5 VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=65536, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=5, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L122] COND TRUE (var_1_11 + var_1_20) <= ((var_1_21 * last_1_var_1_22) * var_1_19) [L123] var_1_22 = (((((var_1_9 - var_1_11)) > (var_1_10)) ? ((var_1_9 - var_1_11)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=65536, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=5, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L125] var_1_47 = var_1_45 VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=65536, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=5, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=16382, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L126] COND FALSE !(var_1_9 < var_1_11) VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=65536, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=5, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=16382, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L199] RET step() [L200] CALL, EXPR property() [L190-L191] return ((((((((var_1_2 ? (var_1_1 == ((double) (((((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) < (var_1_7)) ? ((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) : (var_1_7))))) : 1) && (var_1_8 == ((unsigned short int) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11)))) && (var_1_2 ? (var_1_12 == ((double) (((((var_1_3 - (var_1_13 - 128.68))) < (var_1_7)) ? ((var_1_3 - (var_1_13 - 128.68))) : (var_1_7))))) : 1)) && (var_1_14 == ((double) var_1_6))) && ((var_1_13 >= var_1_14) ? (var_1_2 ? ((var_1_8 == var_1_11) ? (var_1_15 == ((float) 10.975f)) : 1) : 1) : 1)) && ((var_1_3 <= var_1_4) ? (var_1_16 == ((float) ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))))) : 1)) && ((var_1_7 >= (var_1_5 / ((((var_1_13) < (var_1_18)) ? (var_1_13) : (var_1_18))))) ? (((var_1_10 + var_1_9) <= var_1_11) ? (var_1_2 ? (var_1_17 == ((signed short int) var_1_19)) : 1) : (var_1_17 == ((signed short int) (var_1_20 - ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))))) : (var_1_17 == ((signed short int) var_1_21)))) && (((var_1_11 + var_1_20) <= ((var_1_21 * last_1_var_1_22) * var_1_19)) ? (var_1_22 == ((unsigned short int) (((((var_1_9 - var_1_11)) > (var_1_10)) ? ((var_1_9 - var_1_11)) : (var_1_10))))) : 1)) && ((var_1_9 < var_1_11) ? ((var_1_2 || var_1_25) ? (var_1_24 == ((unsigned short int) 128)) : 1) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=5, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=16382, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L200] RET, EXPR property() [L200] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=5, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=16382, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=5, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=16382, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 10, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1374 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1344 mSDsluCounter, 3242 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1881 mSDsCounter, 395 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2179 IncrementalHoareTripleChecker+Invalid, 2574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 395 mSolverCounterUnsat, 1361 mSDtfsCounter, 2179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1969 GetRequests, 1877 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=4, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 477 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2948 NumberOfCodeBlocks, 2948 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3141 ConstructedInterpolants, 0 QuantifiedInterpolants, 6853 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1449 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 29205/29760 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 21:42:06,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.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 1826fac0aaf6beb599525d92da03802aca3a315a8be49017dad700e98d033a28 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:42:08,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:42:08,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:42:08,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:42:08,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:42:08,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:42:08,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:42:08,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:42:08,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:42:08,109 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:42:08,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:42:08,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:42:08,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:42:08,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:42:08,110 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:42:08,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:42:08,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:42:08,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:42:08,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:42:08,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:42:08,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:42:08,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:42:08,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:42:08,115 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:42:08,116 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:42:08,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:42:08,117 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:42:08,117 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:42:08,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:42:08,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:42:08,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:42:08,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:42:08,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:42:08,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:42:08,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:42:08,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:42:08,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:42:08,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:42:08,118 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:42:08,118 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:42:08,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:42:08,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:42:08,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:42:08,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:42:08,120 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 -> 1826fac0aaf6beb599525d92da03802aca3a315a8be49017dad700e98d033a28 [2024-11-08 21:42:08,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:42:08,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:42:08,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:42:08,374 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:42:08,374 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:42:08,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-11-08 21:42:09,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:42:09,777 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:42:09,777 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-11-08 21:42:09,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3256e850e/973c232e961a4a0c9aab367001f9f5a2/FLAGad1452d22 [2024-11-08 21:42:09,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3256e850e/973c232e961a4a0c9aab367001f9f5a2 [2024-11-08 21:42:09,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:42:09,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:42:09,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:42:09,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:42:09,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:42:09,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:42:09" (1/1) ... [2024-11-08 21:42:09,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c146d08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:09, skipping insertion in model container [2024-11-08 21:42:09,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:42:09" (1/1) ... [2024-11-08 21:42:09,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:42:09,981 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_fillercode_fillercodestructure_filler-pr-ci_file-36.i[919,932] [2024-11-08 21:42:10,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:42:10,080 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:42:10,089 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_fillercode_fillercodestructure_filler-pr-ci_file-36.i[919,932] [2024-11-08 21:42:10,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:42:10,151 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:42:10,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:10 WrapperNode [2024-11-08 21:42:10,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:42:10,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:42:10,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:42:10,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:42:10,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:10" (1/1) ... [2024-11-08 21:42:10,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:10" (1/1) ... [2024-11-08 21:42:10,200 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2024-11-08 21:42:10,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:42:10,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:42:10,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:42:10,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:42:10,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:10" (1/1) ... [2024-11-08 21:42:10,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:10" (1/1) ... [2024-11-08 21:42:10,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:10" (1/1) ... [2024-11-08 21:42:10,236 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:42:10,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:10" (1/1) ... [2024-11-08 21:42:10,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:10" (1/1) ... [2024-11-08 21:42:10,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:10" (1/1) ... [2024-11-08 21:42:10,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:10" (1/1) ... [2024-11-08 21:42:10,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:10" (1/1) ... [2024-11-08 21:42:10,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:10" (1/1) ... [2024-11-08 21:42:10,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:42:10,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:42:10,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:42:10,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:42:10,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:10" (1/1) ... [2024-11-08 21:42:10,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:42:10,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:42:10,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:42:10,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:42:10,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:42:10,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:42:10,328 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:42:10,329 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:42:10,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:42:10,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:42:10,409 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:42:10,410 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:42:25,457 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 21:42:25,458 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:42:25,468 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:42:25,468 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:42:25,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:42:25 BoogieIcfgContainer [2024-11-08 21:42:25,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:42:25,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:42:25,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:42:25,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:42:25,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:42:09" (1/3) ... [2024-11-08 21:42:25,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f16df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:42:25, skipping insertion in model container [2024-11-08 21:42:25,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:10" (2/3) ... [2024-11-08 21:42:25,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f16df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:42:25, skipping insertion in model container [2024-11-08 21:42:25,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:42:25" (3/3) ... [2024-11-08 21:42:25,475 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-11-08 21:42:25,488 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:42:25,488 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:42:25,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:42:25,542 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;@b534cc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:42:25,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:42:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 21:42:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 21:42:25,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:42:25,564 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:42:25,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:42:25,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:42:25,571 INFO L85 PathProgramCache]: Analyzing trace with hash -340649538, now seen corresponding path program 1 times [2024-11-08 21:42:25,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:42:25,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417503492] [2024-11-08 21:42:25,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:42:25,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:42:25,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:42:25,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:42:25,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 21:42:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:26,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:42:26,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:42:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 942 proven. 0 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2024-11-08 21:42:26,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:42:26,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:42:26,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417503492] [2024-11-08 21:42:26,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417503492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:42:26,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:42:26,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:42:26,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828957886] [2024-11-08 21:42:26,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:42:26,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:42:26,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:42:26,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:42:26,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:42:26,881 INFO L87 Difference]: Start difference. First operand has 96 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 21:42:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:42:26,906 INFO L93 Difference]: Finished difference Result 185 states and 326 transitions. [2024-11-08 21:42:26,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:42:26,908 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 207 [2024-11-08 21:42:26,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:42:26,914 INFO L225 Difference]: With dead ends: 185 [2024-11-08 21:42:26,914 INFO L226 Difference]: Without dead ends: 92 [2024-11-08 21:42:26,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:42:26,922 INFO L432 NwaCegarLoop]: 143 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, 143 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:42:26,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:42:26,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-08 21:42:26,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-08 21:42:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 58 states have internal predecessors, (79), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 21:42:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 143 transitions. [2024-11-08 21:42:26,957 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 143 transitions. Word has length 207 [2024-11-08 21:42:26,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:42:26,958 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 143 transitions. [2024-11-08 21:42:26,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 21:42:26,958 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 143 transitions. [2024-11-08 21:42:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 21:42:26,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:42:26,965 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:42:26,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 21:42:27,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:42:27,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:42:27,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:42:27,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1320989182, now seen corresponding path program 1 times [2024-11-08 21:42:27,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:42:27,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385251802] [2024-11-08 21:42:27,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:42:27,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:42:27,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:42:27,171 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:42:27,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 21:42:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:28,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:42:28,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:42:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:42:28,430 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:42:28,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:42:28,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385251802] [2024-11-08 21:42:28,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385251802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:42:28,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:42:28,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:42:28,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982239429] [2024-11-08 21:42:28,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:42:28,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:42:28,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:42:28,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:42:28,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:42:28,438 INFO L87 Difference]: Start difference. First operand 92 states and 143 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:42:33,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:42:38,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:42:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:42:38,106 INFO L93 Difference]: Finished difference Result 212 states and 332 transitions. [2024-11-08 21:42:38,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:42:38,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-11-08 21:42:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:42:38,109 INFO L225 Difference]: With dead ends: 212 [2024-11-08 21:42:38,109 INFO L226 Difference]: Without dead ends: 123 [2024-11-08 21:42:38,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:42:38,111 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 43 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-11-08 21:42:38,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 267 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 9.6s Time] [2024-11-08 21:42:38,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-08 21:42:38,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2024-11-08 21:42:38,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 21:42:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 169 transitions. [2024-11-08 21:42:38,130 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 169 transitions. Word has length 207 [2024-11-08 21:42:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:42:38,132 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 169 transitions. [2024-11-08 21:42:38,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:42:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 169 transitions. [2024-11-08 21:42:38,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 21:42:38,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:42:38,137 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:42:38,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 21:42:38,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:42:38,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:42:38,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:42:38,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1285034372, now seen corresponding path program 1 times [2024-11-08 21:42:38,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:42:38,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660360246] [2024-11-08 21:42:38,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:42:38,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:42:38,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:42:38,341 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:42:38,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 21:42:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:39,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:42:39,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:42:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:42:39,614 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:42:39,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:42:39,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660360246] [2024-11-08 21:42:39,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660360246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:42:39,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:42:39,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:42:39,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789372866] [2024-11-08 21:42:39,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:42:39,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:42:39,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:42:39,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:42:39,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:42:39,619 INFO L87 Difference]: Start difference. First operand 109 states and 169 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:42:44,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:42:48,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:42:48,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:42:48,965 INFO L93 Difference]: Finished difference Result 229 states and 354 transitions. [2024-11-08 21:42:49,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:42:49,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-11-08 21:42:49,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:42:49,056 INFO L225 Difference]: With dead ends: 229 [2024-11-08 21:42:49,056 INFO L226 Difference]: Without dead ends: 123 [2024-11-08 21:42:49,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:42:49,063 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 46 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:42:49,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 260 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2024-11-08 21:42:49,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-08 21:42:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2024-11-08 21:42:49,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 21:42:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 175 transitions. [2024-11-08 21:42:49,077 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 175 transitions. Word has length 207 [2024-11-08 21:42:49,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:42:49,078 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 175 transitions. [2024-11-08 21:42:49,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:42:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 175 transitions. [2024-11-08 21:42:49,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 21:42:49,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:42:49,083 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:42:49,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 21:42:49,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:42:49,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:42:49,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:42:49,285 INFO L85 PathProgramCache]: Analyzing trace with hash -503340732, now seen corresponding path program 1 times [2024-11-08 21:42:49,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:42:49,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136604712] [2024-11-08 21:42:49,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:42:49,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:42:49,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:42:49,288 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:42:49,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 21:42:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:50,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 21:42:50,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:43:04,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1267 proven. 180 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2024-11-08 21:43:04,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:43:08,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:43:08,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136604712] [2024-11-08 21:43:08,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136604712] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:43:08,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1839818550] [2024-11-08 21:43:08,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:43:08,113 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 21:43:08,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 21:43:08,115 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 21:43:08,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-08 21:43:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:11,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 21:43:11,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:43:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1021 proven. 120 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2024-11-08 21:43:17,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:43:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 60 proven. 123 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2024-11-08 21:43:23,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1839818550] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:43:23,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:43:23,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 8] total 26 [2024-11-08 21:43:23,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674798872] [2024-11-08 21:43:23,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:43:23,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 21:43:23,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:43:23,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 21:43:23,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=694, Unknown=0, NotChecked=0, Total=992 [2024-11-08 21:43:23,003 INFO L87 Difference]: Start difference. First operand 115 states and 175 transitions. Second operand has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 25 states have internal predecessors, (132), 9 states have call successors, (78), 8 states have call predecessors, (78), 15 states have return successors, (80), 9 states have call predecessors, (80), 9 states have call successors, (80)