./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.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 93ab9944ae60dcd2ea1c66f43a88f1592af9bef96260d06a583314616c867c3e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:34:37,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:34:37,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:34:37,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:34:37,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:34:37,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:34:37,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:34:37,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:34:37,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:34:37,886 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:34:37,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:34:37,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:34:37,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:34:37,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:34:37,891 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:34:37,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:34:37,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:34:37,891 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:34:37,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:34:37,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:34:37,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:34:37,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:34:37,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:34:37,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:34:37,897 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:34:37,897 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:34:37,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:34:37,897 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:34:37,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:34:37,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:34:37,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:34:37,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:34:37,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:34:37,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:34:37,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:34:37,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:34:37,899 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:34:37,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:34:37,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:34:37,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:34:37,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:34:37,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:34:37,901 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 -> 93ab9944ae60dcd2ea1c66f43a88f1592af9bef96260d06a583314616c867c3e [2024-10-14 10:34:38,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:34:38,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:34:38,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:34:38,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:34:38,132 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:34:38,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i [2024-10-14 10:34:39,481 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:34:39,671 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:34:39,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i [2024-10-14 10:34:39,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d13c5796/c928756f36244703a66b904dacf4abb6/FLAG0d72d8cc7 [2024-10-14 10:34:39,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d13c5796/c928756f36244703a66b904dacf4abb6 [2024-10-14 10:34:39,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:34:39,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:34:39,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:34:39,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:34:39,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:34:39,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:34:39" (1/1) ... [2024-10-14 10:34:39,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e555457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:39, skipping insertion in model container [2024-10-14 10:34:39,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:34:39" (1/1) ... [2024-10-14 10:34:39,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:34:39,835 WARN L248 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-ps-co_file-7.i[918,931] [2024-10-14 10:34:39,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:34:39,944 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:34:39,973 WARN L248 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-ps-co_file-7.i[918,931] [2024-10-14 10:34:40,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:34:40,051 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:34:40,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:40 WrapperNode [2024-10-14 10:34:40,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:34:40,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:34:40,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:34:40,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:34:40,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:40" (1/1) ... [2024-10-14 10:34:40,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:40" (1/1) ... [2024-10-14 10:34:40,126 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 299 [2024-10-14 10:34:40,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:34:40,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:34:40,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:34:40,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:34:40,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:40" (1/1) ... [2024-10-14 10:34:40,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:40" (1/1) ... [2024-10-14 10:34:40,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:40" (1/1) ... [2024-10-14 10:34:40,171 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-10-14 10:34:40,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:40" (1/1) ... [2024-10-14 10:34:40,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:40" (1/1) ... [2024-10-14 10:34:40,184 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:40" (1/1) ... [2024-10-14 10:34:40,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:40" (1/1) ... [2024-10-14 10:34:40,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:40" (1/1) ... [2024-10-14 10:34:40,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:40" (1/1) ... [2024-10-14 10:34:40,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:34:40,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:34:40,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:34:40,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:34:40,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:40" (1/1) ... [2024-10-14 10:34:40,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:34:40,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:34:40,252 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-10-14 10:34:40,254 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-10-14 10:34:40,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:34:40,291 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:34:40,291 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:34:40,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:34:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:34:40,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:34:40,362 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:34:40,364 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:34:40,708 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-14 10:34:40,708 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:34:40,760 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:34:40,760 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:34:40,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:34:40 BoogieIcfgContainer [2024-10-14 10:34:40,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:34:40,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:34:40,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:34:40,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:34:40,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:34:39" (1/3) ... [2024-10-14 10:34:40,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6cc905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:34:40, skipping insertion in model container [2024-10-14 10:34:40,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:40" (2/3) ... [2024-10-14 10:34:40,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6cc905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:34:40, skipping insertion in model container [2024-10-14 10:34:40,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:34:40" (3/3) ... [2024-10-14 10:34:40,769 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i [2024-10-14 10:34:40,784 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:34:40,784 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:34:40,847 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:34:40,852 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;@3a03da21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:34:40,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:34:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 82 states have internal predecessors, (119), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 10:34:40,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-14 10:34:40,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:40,879 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:34:40,879 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:40,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:40,884 INFO L85 PathProgramCache]: Analyzing trace with hash -623973017, now seen corresponding path program 1 times [2024-10-14 10:34:40,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:34:40,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208339094] [2024-10-14 10:34:40,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:40,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:34:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:34:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:34:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:34:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 10:34:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:34:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 10:34:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:34:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 10:34:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:34:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:34:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:34:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:34:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:34:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:34:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:34:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:34:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:34:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:34:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:34:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:34:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:34:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 10:34:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 10:34:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 10:34:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:34:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 10:34:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:34:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:34:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 10:34:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:34:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:34:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 10:34:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-14 10:34:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 10:34:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 10:34:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 10:34:41,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:34:41,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208339094] [2024-10-14 10:34:41,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208339094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:34:41,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:34:41,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:34:41,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588131693] [2024-10-14 10:34:41,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:34:41,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:34:41,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:34:41,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:34:41,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:34:41,507 INFO L87 Difference]: Start difference. First operand has 119 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 82 states have internal predecessors, (119), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-14 10:34:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:34:41,602 INFO L93 Difference]: Finished difference Result 230 states and 404 transitions. [2024-10-14 10:34:41,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:34:41,604 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 226 [2024-10-14 10:34:41,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:34:41,619 INFO L225 Difference]: With dead ends: 230 [2024-10-14 10:34:41,619 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 10:34:41,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-10-14 10:34:41,629 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:34:41,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:34:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 10:34:41,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-14 10:34:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 10:34:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 175 transitions. [2024-10-14 10:34:41,677 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 175 transitions. Word has length 226 [2024-10-14 10:34:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:34:41,677 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 175 transitions. [2024-10-14 10:34:41,678 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-14 10:34:41,678 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 175 transitions. [2024-10-14 10:34:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-14 10:34:41,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:41,681 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:34:41,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:34:41,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:41,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:41,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2126998383, now seen corresponding path program 1 times [2024-10-14 10:34:41,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:34:41,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590024240] [2024-10-14 10:34:41,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:41,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:34:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:34:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:34:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:34:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 10:34:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:34:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 10:34:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:34:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 10:34:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:34:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:34:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:34:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:34:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:41,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:34:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:34:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:34:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:34:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:34:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:34:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:34:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:34:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:34:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 10:34:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 10:34:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 10:34:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:34:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 10:34:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:34:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:34:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 10:34:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:34:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:34:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 10:34:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-14 10:34:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 10:34:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 10:34:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 10:34:42,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:34:42,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590024240] [2024-10-14 10:34:42,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590024240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:34:42,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:34:42,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:34:42,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920023284] [2024-10-14 10:34:42,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:34:42,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:34:42,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:34:42,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:34:42,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:34:42,115 INFO L87 Difference]: Start difference. First operand 112 states and 175 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:34:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:34:42,201 INFO L93 Difference]: Finished difference Result 334 states and 523 transitions. [2024-10-14 10:34:42,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:34:42,202 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 226 [2024-10-14 10:34:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:34:42,205 INFO L225 Difference]: With dead ends: 334 [2024-10-14 10:34:42,206 INFO L226 Difference]: Without dead ends: 223 [2024-10-14 10:34:42,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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-10-14 10:34:42,208 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 107 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:34:42,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 341 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:34:42,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-14 10:34:42,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2024-10-14 10:34:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 148 states have (on average 1.385135135135135) internal successors, (205), 148 states have internal predecessors, (205), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 10:34:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 345 transitions. [2024-10-14 10:34:42,242 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 345 transitions. Word has length 226 [2024-10-14 10:34:42,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:34:42,243 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 345 transitions. [2024-10-14 10:34:42,243 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:34:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 345 transitions. [2024-10-14 10:34:42,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-14 10:34:42,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:42,246 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:34:42,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 10:34:42,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:42,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:42,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1147351911, now seen corresponding path program 1 times [2024-10-14 10:34:42,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:34:42,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702560562] [2024-10-14 10:34:42,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:42,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:34:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:34:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:34:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:34:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 10:34:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:34:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 10:34:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:34:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 10:34:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:34:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:34:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:34:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:34:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:34:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:34:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:34:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:34:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:34:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:34:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:34:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:34:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:34:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 10:34:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 10:34:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 10:34:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:34:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 10:34:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:34:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:34:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 10:34:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:34:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:34:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 10:34:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-14 10:34:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 10:34:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 10:34:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 10:34:42,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:34:42,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702560562] [2024-10-14 10:34:42,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702560562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:34:42,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:34:42,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:34:42,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599694672] [2024-10-14 10:34:42,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:34:42,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:34:42,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:34:42,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:34:42,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:34:42,538 INFO L87 Difference]: Start difference. First operand 221 states and 345 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:34:42,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:34:42,585 INFO L93 Difference]: Finished difference Result 536 states and 835 transitions. [2024-10-14 10:34:42,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:34:42,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 229 [2024-10-14 10:34:42,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:34:42,588 INFO L225 Difference]: With dead ends: 536 [2024-10-14 10:34:42,589 INFO L226 Difference]: Without dead ends: 316 [2024-10-14 10:34:42,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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-10-14 10:34:42,594 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 81 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:34:42,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 333 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:34:42,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-10-14 10:34:42,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 290. [2024-10-14 10:34:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 181 states have (on average 1.3204419889502763) internal successors, (239), 181 states have internal predecessors, (239), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-14 10:34:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 449 transitions. [2024-10-14 10:34:42,634 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 449 transitions. Word has length 229 [2024-10-14 10:34:42,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:34:42,634 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 449 transitions. [2024-10-14 10:34:42,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:34:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 449 transitions. [2024-10-14 10:34:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-14 10:34:42,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:42,637 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:34:42,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 10:34:42,637 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:42,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:42,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1824282917, now seen corresponding path program 1 times [2024-10-14 10:34:42,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:34:42,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694304545] [2024-10-14 10:34:42,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:42,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:34:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:34:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:34:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:34:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 10:34:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:34:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 10:34:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:34:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 10:34:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:34:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:34:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:34:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:34:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:34:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:34:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:34:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:34:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:34:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:34:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:34:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:34:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:34:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 10:34:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 10:34:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 10:34:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:34:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 10:34:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:34:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:34:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 10:34:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:34:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:34:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 10:34:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-14 10:34:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 10:34:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 10:34:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 10:34:42,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:34:42,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694304545] [2024-10-14 10:34:42,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694304545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:34:42,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:34:42,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:34:42,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898183021] [2024-10-14 10:34:42,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:34:42,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:34:42,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:34:42,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:34:42,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:34:42,824 INFO L87 Difference]: Start difference. First operand 290 states and 449 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:34:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:34:42,877 INFO L93 Difference]: Finished difference Result 536 states and 834 transitions. [2024-10-14 10:34:42,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:34:42,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 230 [2024-10-14 10:34:42,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:34:42,881 INFO L225 Difference]: With dead ends: 536 [2024-10-14 10:34:42,881 INFO L226 Difference]: Without dead ends: 316 [2024-10-14 10:34:42,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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-10-14 10:34:42,884 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 79 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:34:42,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 324 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:34:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-10-14 10:34:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 291. [2024-10-14 10:34:42,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 182 states have (on average 1.3186813186813187) internal successors, (240), 182 states have internal predecessors, (240), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-14 10:34:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 450 transitions. [2024-10-14 10:34:42,918 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 450 transitions. Word has length 230 [2024-10-14 10:34:42,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:34:42,920 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 450 transitions. [2024-10-14 10:34:42,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:34:42,920 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 450 transitions. [2024-10-14 10:34:42,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-14 10:34:42,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:42,923 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:34:42,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 10:34:42,923 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:42,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:42,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1023998940, now seen corresponding path program 1 times [2024-10-14 10:34:42,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:34:42,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863104144] [2024-10-14 10:34:42,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:42,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:34:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:34:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:34:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:34:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 10:34:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:34:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 10:34:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:34:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 10:34:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:34:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:34:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:34:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:34:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:34:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:34:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:34:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:34:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:34:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:34:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:34:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:34:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:34:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 10:34:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 10:34:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 10:34:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:34:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 10:34:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:34:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:34:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 10:34:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:34:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:34:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 10:34:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-14 10:34:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 10:34:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 10:34:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 10:34:43,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:34:43,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863104144] [2024-10-14 10:34:43,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863104144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:34:43,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:34:43,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:34:43,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677712682] [2024-10-14 10:34:43,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:34:43,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:34:43,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:34:43,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:34:43,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:34:43,147 INFO L87 Difference]: Start difference. First operand 291 states and 450 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:34:43,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:34:43,188 INFO L93 Difference]: Finished difference Result 542 states and 843 transitions. [2024-10-14 10:34:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:34:43,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 231 [2024-10-14 10:34:43,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:34:43,191 INFO L225 Difference]: With dead ends: 542 [2024-10-14 10:34:43,191 INFO L226 Difference]: Without dead ends: 322 [2024-10-14 10:34:43,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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-10-14 10:34:43,194 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 78 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:34:43,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 335 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:34:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-14 10:34:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 307. [2024-10-14 10:34:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 198 states have (on average 1.3383838383838385) internal successors, (265), 198 states have internal predecessors, (265), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-14 10:34:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 475 transitions. [2024-10-14 10:34:43,228 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 475 transitions. Word has length 231 [2024-10-14 10:34:43,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:34:43,229 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 475 transitions. [2024-10-14 10:34:43,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:34:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 475 transitions. [2024-10-14 10:34:43,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-14 10:34:43,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:43,232 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:34:43,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 10:34:43,232 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:43,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:43,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1155331833, now seen corresponding path program 1 times [2024-10-14 10:34:43,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:34:43,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760183508] [2024-10-14 10:34:43,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:43,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:34:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:34:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:34:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:34:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 10:34:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:34:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 10:34:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:34:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 10:34:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:34:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:34:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:34:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:34:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:34:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:34:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:34:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:34:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:34:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:34:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:34:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:34:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:34:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 10:34:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 10:34:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 10:34:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:34:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 10:34:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:34:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:34:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 10:34:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:34:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:34:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 10:34:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-14 10:34:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 10:34:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 10:34:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 10:34:43,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:34:43,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760183508] [2024-10-14 10:34:43,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760183508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:34:43,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:34:43,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:34:43,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763195] [2024-10-14 10:34:43,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:34:43,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:34:43,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:34:43,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:34:43,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:34:43,483 INFO L87 Difference]: Start difference. First operand 307 states and 475 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:34:43,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:34:43,573 INFO L93 Difference]: Finished difference Result 544 states and 845 transitions. [2024-10-14 10:34:43,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 10:34:43,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 233 [2024-10-14 10:34:43,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:34:43,579 INFO L225 Difference]: With dead ends: 544 [2024-10-14 10:34:43,579 INFO L226 Difference]: Without dead ends: 324 [2024-10-14 10:34:43,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:34:43,580 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 75 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:34:43,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 491 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:34:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-14 10:34:43,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 310. [2024-10-14 10:34:43,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 201 states have (on average 1.3333333333333333) internal successors, (268), 201 states have internal predecessors, (268), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-14 10:34:43,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 478 transitions. [2024-10-14 10:34:43,610 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 478 transitions. Word has length 233 [2024-10-14 10:34:43,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:34:43,611 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 478 transitions. [2024-10-14 10:34:43,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:34:43,611 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 478 transitions. [2024-10-14 10:34:43,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-14 10:34:43,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:43,614 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:34:43,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 10:34:43,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:43,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:43,615 INFO L85 PathProgramCache]: Analyzing trace with hash 271591513, now seen corresponding path program 1 times [2024-10-14 10:34:43,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:34:43,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91121348] [2024-10-14 10:34:43,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:43,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:34:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:34:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:34:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:34:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 10:34:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:34:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 10:34:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:34:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 10:34:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:43,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:34:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:34:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:34:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:34:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:34:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:34:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:34:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:34:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:34:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:34:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:34:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:34:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:34:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 10:34:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 10:34:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 10:34:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:34:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 10:34:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:34:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:34:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 10:34:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:34:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:34:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 10:34:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-14 10:34:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 10:34:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 10:34:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 10:34:44,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:34:44,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91121348] [2024-10-14 10:34:44,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91121348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:34:44,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:34:44,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 10:34:44,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979123049] [2024-10-14 10:34:44,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:34:44,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 10:34:44,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:34:44,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 10:34:44,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 10:34:44,078 INFO L87 Difference]: Start difference. First operand 310 states and 478 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:34:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:34:44,328 INFO L93 Difference]: Finished difference Result 693 states and 1065 transitions. [2024-10-14 10:34:44,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 10:34:44,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 234 [2024-10-14 10:34:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:34:44,332 INFO L225 Difference]: With dead ends: 693 [2024-10-14 10:34:44,332 INFO L226 Difference]: Without dead ends: 464 [2024-10-14 10:34:44,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-14 10:34:44,334 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 254 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:34:44,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 622 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:34:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-10-14 10:34:44,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 440. [2024-10-14 10:34:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 281 states have (on average 1.3060498220640568) internal successors, (367), 283 states have internal predecessors, (367), 153 states have call successors, (153), 5 states have call predecessors, (153), 5 states have return successors, (153), 151 states have call predecessors, (153), 153 states have call successors, (153) [2024-10-14 10:34:44,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 673 transitions. [2024-10-14 10:34:44,374 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 673 transitions. Word has length 234 [2024-10-14 10:34:44,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:34:44,374 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 673 transitions. [2024-10-14 10:34:44,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:34:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 673 transitions. [2024-10-14 10:34:44,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-14 10:34:44,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:44,376 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:34:44,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 10:34:44,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:44,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:44,377 INFO L85 PathProgramCache]: Analyzing trace with hash 529756951, now seen corresponding path program 1 times [2024-10-14 10:34:44,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:34:44,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492481552] [2024-10-14 10:34:44,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:44,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:34:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:34:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:34:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:34:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 10:34:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:34:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 10:34:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:34:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 10:34:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:34:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:34:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:34:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:44,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:34:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:34:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:34:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:34:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:34:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:34:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:34:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:34:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:34:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:34:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 10:34:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 10:34:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 10:34:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:34:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 10:34:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:34:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:34:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 10:34:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:34:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:34:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 10:34:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-14 10:34:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 10:34:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 10:34:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 10:34:45,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:34:45,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492481552] [2024-10-14 10:34:45,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492481552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:34:45,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:34:45,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 10:34:45,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661196730] [2024-10-14 10:34:45,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:34:45,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 10:34:45,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:34:45,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 10:34:45,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:34:45,111 INFO L87 Difference]: Start difference. First operand 440 states and 673 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-14 10:34:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:34:45,494 INFO L93 Difference]: Finished difference Result 849 states and 1296 transitions. [2024-10-14 10:34:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 10:34:45,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 234 [2024-10-14 10:34:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:34:45,498 INFO L225 Difference]: With dead ends: 849 [2024-10-14 10:34:45,499 INFO L226 Difference]: Without dead ends: 485 [2024-10-14 10:34:45,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-14 10:34:45,500 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 209 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:34:45,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 629 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 10:34:45,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-10-14 10:34:45,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 453. [2024-10-14 10:34:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 294 states have (on average 1.2993197278911566) internal successors, (382), 296 states have internal predecessors, (382), 153 states have call successors, (153), 5 states have call predecessors, (153), 5 states have return successors, (153), 151 states have call predecessors, (153), 153 states have call successors, (153) [2024-10-14 10:34:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 688 transitions. [2024-10-14 10:34:45,568 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 688 transitions. Word has length 234 [2024-10-14 10:34:45,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:34:45,568 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 688 transitions. [2024-10-14 10:34:45,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-14 10:34:45,569 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 688 transitions. [2024-10-14 10:34:45,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-14 10:34:45,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:45,571 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:34:45,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 10:34:45,571 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:45,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:45,572 INFO L85 PathProgramCache]: Analyzing trace with hash -278435971, now seen corresponding path program 1 times [2024-10-14 10:34:45,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:34:45,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781336159] [2024-10-14 10:34:45,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:45,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:34:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:34:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:34:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:34:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 10:34:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:34:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 10:34:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:34:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 10:34:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:34:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:34:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:34:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:34:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:34:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:34:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:34:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:34:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:34:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:34:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:34:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:34:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:34:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 10:34:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 10:34:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 10:34:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:34:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 10:34:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:34:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:34:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 10:34:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:34:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:34:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 10:34:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-14 10:34:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 10:34:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 10:34:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 10:34:46,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:34:46,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781336159] [2024-10-14 10:34:46,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781336159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:34:46,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:34:46,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 10:34:46,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739773144] [2024-10-14 10:34:46,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:34:46,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 10:34:46,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:34:46,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 10:34:46,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 10:34:46,154 INFO L87 Difference]: Start difference. First operand 453 states and 688 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:34:46,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:34:46,860 INFO L93 Difference]: Finished difference Result 830 states and 1269 transitions. [2024-10-14 10:34:46,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 10:34:46,861 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 235 [2024-10-14 10:34:46,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:34:46,864 INFO L225 Difference]: With dead ends: 830 [2024-10-14 10:34:46,864 INFO L226 Difference]: Without dead ends: 485 [2024-10-14 10:34:46,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-14 10:34:46,867 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 211 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 10:34:46,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 761 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 10:34:46,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-10-14 10:34:46,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 455. [2024-10-14 10:34:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 296 states have (on average 1.2972972972972974) internal successors, (384), 298 states have internal predecessors, (384), 153 states have call successors, (153), 5 states have call predecessors, (153), 5 states have return successors, (153), 151 states have call predecessors, (153), 153 states have call successors, (153) [2024-10-14 10:34:46,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 690 transitions. [2024-10-14 10:34:46,900 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 690 transitions. Word has length 235 [2024-10-14 10:34:46,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:34:46,900 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 690 transitions. [2024-10-14 10:34:46,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:34:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 690 transitions. [2024-10-14 10:34:46,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-14 10:34:46,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:46,902 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:34:46,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 10:34:46,903 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:46,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:46,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1191138894, now seen corresponding path program 1 times [2024-10-14 10:34:46,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:34:46,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117698078] [2024-10-14 10:34:46,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:46,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:34:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:34:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:34:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:34:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 10:34:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:34:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 10:34:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:34:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 10:34:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:34:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:34:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:34:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:34:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:34:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:34:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:34:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:34:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:34:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:34:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:34:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:34:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:34:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 10:34:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 10:34:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 10:34:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:34:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 10:34:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:34:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:34:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 10:34:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:34:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:34:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 10:34:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-14 10:34:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 10:34:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 10:34:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 75 proven. 27 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-10-14 10:34:47,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:34:47,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117698078] [2024-10-14 10:34:47,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117698078] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:34:47,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474056584] [2024-10-14 10:34:47,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:47,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:34:47,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:34:47,412 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-10-14 10:34:47,413 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-10-14 10:34:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:47,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 10:34:47,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:34:48,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 984 proven. 27 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2024-10-14 10:34:48,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:34:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 75 proven. 27 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-10-14 10:34:48,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474056584] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:34:48,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 10:34:48,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 15 [2024-10-14 10:34:48,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299610318] [2024-10-14 10:34:48,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 10:34:48,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 10:34:48,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:34:48,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 10:34:48,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-14 10:34:48,935 INFO L87 Difference]: Start difference. First operand 455 states and 690 transitions. Second operand has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 15 states have internal predecessors, (154), 6 states have call successors, (105), 3 states have call predecessors, (105), 6 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) [2024-10-14 10:34:49,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:34:49,716 INFO L93 Difference]: Finished difference Result 947 states and 1445 transitions. [2024-10-14 10:34:49,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 10:34:49,717 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 15 states have internal predecessors, (154), 6 states have call successors, (105), 3 states have call predecessors, (105), 6 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) Word has length 236 [2024-10-14 10:34:49,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:34:49,721 INFO L225 Difference]: With dead ends: 947 [2024-10-14 10:34:49,721 INFO L226 Difference]: Without dead ends: 593 [2024-10-14 10:34:49,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 534 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2024-10-14 10:34:49,724 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 826 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 10:34:49,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 734 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 10:34:49,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-10-14 10:34:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 489. [2024-10-14 10:34:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 329 states have (on average 1.3282674772036474) internal successors, (437), 331 states have internal predecessors, (437), 153 states have call successors, (153), 6 states have call predecessors, (153), 6 states have return successors, (153), 151 states have call predecessors, (153), 153 states have call successors, (153) [2024-10-14 10:34:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 743 transitions. [2024-10-14 10:34:49,772 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 743 transitions. Word has length 236 [2024-10-14 10:34:49,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:34:49,773 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 743 transitions. [2024-10-14 10:34:49,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 15 states have internal predecessors, (154), 6 states have call successors, (105), 3 states have call predecessors, (105), 6 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) [2024-10-14 10:34:49,774 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 743 transitions. [2024-10-14 10:34:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-14 10:34:49,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:49,775 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:34:49,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 10:34:49,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 10:34:49,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:49,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:49,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1265353537, now seen corresponding path program 1 times [2024-10-14 10:34:49,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:34:49,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514441599] [2024-10-14 10:34:49,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:49,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:34:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:34:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:34:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:34:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 10:34:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:34:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 10:34:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:34:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 10:34:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:34:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:34:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:34:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:34:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:34:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:34:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:34:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:34:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:34:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:34:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:34:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:34:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:34:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 10:34:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 10:34:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 10:34:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:34:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 10:34:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:34:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:34:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 10:34:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:34:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:34:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 10:34:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-14 10:34:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 10:34:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 10:34:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:50,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 10:34:50,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:34:50,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514441599] [2024-10-14 10:34:50,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514441599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:34:50,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:34:50,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 10:34:50,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794222794] [2024-10-14 10:34:50,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:34:50,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 10:34:50,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:34:50,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 10:34:50,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 10:34:50,531 INFO L87 Difference]: Start difference. First operand 489 states and 743 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:34:51,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:34:51,466 INFO L93 Difference]: Finished difference Result 912 states and 1396 transitions. [2024-10-14 10:34:51,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 10:34:51,466 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 236 [2024-10-14 10:34:51,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:34:51,470 INFO L225 Difference]: With dead ends: 912 [2024-10-14 10:34:51,470 INFO L226 Difference]: Without dead ends: 529 [2024-10-14 10:34:51,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-14 10:34:51,473 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 123 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 10:34:51,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 746 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 10:34:51,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-10-14 10:34:51,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 489. [2024-10-14 10:34:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 329 states have (on average 1.325227963525836) internal successors, (436), 331 states have internal predecessors, (436), 153 states have call successors, (153), 6 states have call predecessors, (153), 6 states have return successors, (153), 151 states have call predecessors, (153), 153 states have call successors, (153) [2024-10-14 10:34:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 742 transitions. [2024-10-14 10:34:51,518 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 742 transitions. Word has length 236 [2024-10-14 10:34:51,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:34:51,518 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 742 transitions. [2024-10-14 10:34:51,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:34:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 742 transitions. [2024-10-14 10:34:51,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-14 10:34:51,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:51,520 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:34:51,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 10:34:51,520 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:51,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:51,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2089640764, now seen corresponding path program 1 times [2024-10-14 10:34:51,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:34:51,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956559115] [2024-10-14 10:34:51,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:51,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:34:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:34:51,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 10:34:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:34:51,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 10:34:51,757 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 10:34:51,758 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 10:34:51,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 10:34:51,763 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:34:51,870 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 10:34:51,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:34:51 BoogieIcfgContainer [2024-10-14 10:34:51,873 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 10:34:51,874 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 10:34:51,874 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 10:34:51,874 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 10:34:51,874 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:34:40" (3/4) ... [2024-10-14 10:34:51,876 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 10:34:51,877 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 10:34:51,877 INFO L158 Benchmark]: Toolchain (without parser) took 12179.53ms. Allocated memory was 184.5MB in the beginning and 463.5MB in the end (delta: 278.9MB). Free memory was 110.1MB in the beginning and 211.8MB in the end (delta: -101.7MB). Peak memory consumption was 179.4MB. Max. memory is 16.1GB. [2024-10-14 10:34:51,878 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory was 135.4MB in the beginning and 135.2MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:34:51,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.73ms. Allocated memory was 184.5MB in the beginning and 283.1MB in the end (delta: 98.6MB). Free memory was 110.0MB in the beginning and 249.8MB in the end (delta: -139.8MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-10-14 10:34:51,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.22ms. Allocated memory is still 283.1MB. Free memory was 249.8MB in the beginning and 244.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 10:34:51,878 INFO L158 Benchmark]: Boogie Preprocessor took 82.94ms. Allocated memory is still 283.1MB. Free memory was 244.6MB in the beginning and 239.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 10:34:51,878 INFO L158 Benchmark]: RCFGBuilder took 550.17ms. Allocated memory is still 283.1MB. Free memory was 239.3MB in the beginning and 205.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-14 10:34:51,879 INFO L158 Benchmark]: TraceAbstraction took 11110.45ms. Allocated memory was 283.1MB in the beginning and 463.5MB in the end (delta: 180.4MB). Free memory was 204.7MB in the beginning and 211.8MB in the end (delta: -7.1MB). Peak memory consumption was 173.3MB. Max. memory is 16.1GB. [2024-10-14 10:34:51,879 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 463.5MB. Free memory is still 211.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:34:51,880 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory was 135.4MB in the beginning and 135.2MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.73ms. Allocated memory was 184.5MB in the beginning and 283.1MB in the end (delta: 98.6MB). Free memory was 110.0MB in the beginning and 249.8MB in the end (delta: -139.8MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.22ms. Allocated memory is still 283.1MB. Free memory was 249.8MB in the beginning and 244.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.94ms. Allocated memory is still 283.1MB. Free memory was 244.6MB in the beginning and 239.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 550.17ms. Allocated memory is still 283.1MB. Free memory was 239.3MB in the beginning and 205.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11110.45ms. Allocated memory was 283.1MB in the beginning and 463.5MB in the end (delta: 180.4MB). Free memory was 204.7MB in the beginning and 211.8MB in the end (delta: -7.1MB). Peak memory consumption was 173.3MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 463.5MB. Free memory is still 211.8MB. 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 196, overapproximation of bitwiseOr at line 65, overapproximation of bitwiseAnd at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryArithmeticFLOAToperation at line 111. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] float var_1_2 = 200.875; [L24] float var_1_3 = 100.25; [L25] float var_1_4 = 99999999.34; [L26] unsigned short int var_1_5 = 10; [L27] unsigned short int var_1_6 = 8; [L28] unsigned long int var_1_7 = 25; [L29] unsigned char var_1_8 = 0; [L30] signed long int var_1_9 = -16; [L31] unsigned short int var_1_10 = 25; [L32] unsigned short int var_1_11 = 10000; [L33] signed short int var_1_12 = -32; [L34] signed char var_1_13 = 4; [L35] signed char var_1_14 = 25; [L36] signed short int var_1_15 = -16; [L37] signed short int var_1_16 = 100; [L38] signed short int var_1_17 = 8; [L39] float var_1_18 = 5.8; [L40] float var_1_19 = 0.19999999999999996; [L41] float var_1_20 = 1.5; [L42] float var_1_21 = 10000000.5; [L43] float var_1_22 = 4.5; [L44] float var_1_23 = 4.25; [L45] signed short int var_1_24 = -16; [L46] unsigned short int var_1_25 = 100; [L47] unsigned long int var_1_27 = 8; [L48] double var_1_32 = 1000000.625; [L49] double var_1_33 = 63.5; [L50] signed long int var_1_34 = 8; [L51] unsigned char var_1_36 = 0; [L52] unsigned char var_1_37 = 0; [L53] unsigned char var_1_38 = 1; [L54] float var_1_39 = 10000000000000.5; [L55] float var_1_40 = 99999999999.625; [L56] float var_1_41 = 4.4; [L57] float var_1_42 = 24.5; [L58] float var_1_43 = 0.0; [L59] float var_1_44 = 0.4; [L60] signed long int var_1_45 = -128; [L61] signed short int var_1_46 = 2; [L200] isInitial = 1 [L201] FCALL initially() [L202] COND TRUE 1 [L203] FCALL updateLastVariables() [L204] CALL updateVariables() [L132] var_1_2 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_3=401/4, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_3=401/4, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L133] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_3=401/4, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L134] var_1_3 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L135] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L136] var_1_4 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L137] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L138] var_1_5 = __VERIFIER_nondet_ushort() [L139] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L139] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L140] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L140] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L141] var_1_6 = __VERIFIER_nondet_ushort() [L142] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_7=25, var_1_8=0, var_1_9=-16] [L142] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_7=25, var_1_8=0, var_1_9=-16] [L143] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L143] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L144] var_1_8 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_9=-16] [L145] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_9=-16] [L146] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L146] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L147] var_1_11 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L148] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=25, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L149] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L149] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L150] var_1_13 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L151] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L152] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L152] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L153] var_1_14 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L154] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L155] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L155] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L156] var_1_16 = __VERIFIER_nondet_short() [L157] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L157] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L158] CALL assume_abort_if_not(var_1_16 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L158] RET assume_abort_if_not(var_1_16 <= 16383) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L159] var_1_17 = __VERIFIER_nondet_short() [L160] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L160] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L161] CALL assume_abort_if_not(var_1_17 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L161] RET assume_abort_if_not(var_1_17 <= 16383) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L162] var_1_19 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L163] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L164] var_1_20 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L165] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L166] var_1_21 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L167] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L168] var_1_22 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L169] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L170] var_1_23 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L171] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L172] var_1_27 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L173] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L174] CALL assume_abort_if_not(var_1_27 <= 17) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L174] RET assume_abort_if_not(var_1_27 <= 17) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L175] var_1_32 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L176] RET assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L177] var_1_33 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_33 >= 0.0F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L178] RET assume_abort_if_not((var_1_33 >= 0.0F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L179] var_1_37 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L180] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L181] CALL assume_abort_if_not(var_1_37 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L181] RET assume_abort_if_not(var_1_37 <= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L182] var_1_40 = __VERIFIER_nondet_float() [L183] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L183] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L184] var_1_41 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L185] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L186] var_1_42 = __VERIFIER_nondet_float() [L187] CALL assume_abort_if_not((var_1_42 >= 0.0F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L187] RET assume_abort_if_not((var_1_42 >= 0.0F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L188] var_1_43 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_43 >= 4611686.018427382800e+12F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 9223372.036854765600e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L189] RET assume_abort_if_not((var_1_43 >= 4611686.018427382800e+12F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 9223372.036854765600e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L190] var_1_44 = __VERIFIER_nondet_float() [L191] CALL assume_abort_if_not((var_1_44 >= 0.0F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L191] RET assume_abort_if_not((var_1_44 >= 0.0F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L204] RET updateVariables() [L205] CALL step() [L65] EXPR var_1_1 >> var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L65] EXPR var_1_12 ^ var_1_9 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L65] COND TRUE (var_1_1 >> var_1_27) > ((var_1_12 ^ var_1_9) + ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) [L66] var_1_25 = ((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) > (0)) ? (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) : (0))) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L72] EXPR var_1_24 | var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L72] EXPR ((var_1_24 | var_1_27) < 0 ) ? -(var_1_24 | var_1_27) : (var_1_24 | var_1_27) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L72] EXPR var_1_24 | var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L72] EXPR ((var_1_24 | var_1_27) < 0 ) ? -(var_1_24 | var_1_27) : (var_1_24 | var_1_27) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L72] COND FALSE !(var_1_10 >= ((((var_1_24 | var_1_27) < 0 ) ? -(var_1_24 | var_1_27) : (var_1_24 | var_1_27)))) [L75] COND TRUE var_1_10 >= var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L76] COND TRUE var_1_32 > var_1_33 [L77] var_1_34 = ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L81] EXPR -10 & var_1_15 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L81] COND TRUE (-10 & var_1_15) <= var_1_1 [L82] COND FALSE !(var_1_33 != var_1_32) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L86] var_1_38 = var_1_37 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L87] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L87] COND TRUE var_1_27 == (var_1_12 ^ var_1_12) [L88] var_1_39 = (((((var_1_40) < (((((var_1_41) < (var_1_42)) ? (var_1_41) : (var_1_42))))) ? (var_1_40) : (((((var_1_41) < (var_1_42)) ? (var_1_41) : (var_1_42)))))) - (var_1_43 - var_1_44)) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=-128, var_1_46=2, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L92] var_1_45 = var_1_27 [L93] var_1_46 = var_1_27 [L94] var_1_9 = ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))) [L95] signed long int stepLocal_1 = 56016 - var_1_11; [L96] signed long int stepLocal_0 = 10; VAL [isInitial=1, stepLocal_0=10, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L97] COND FALSE !(var_1_6 < stepLocal_0) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L102] COND FALSE !((var_1_13 - var_1_14) > (var_1_10 + var_1_11)) [L107] var_1_12 = var_1_14 VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=-16, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L109] var_1_15 = (var_1_14 - (((((var_1_16 + var_1_17)) > (4)) ? ((var_1_16 + var_1_17)) : (4)))) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=-5, var_1_16=5, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L110] COND TRUE var_1_4 > var_1_2 [L111] var_1_18 = (((((var_1_19 + var_1_20) < 0 ) ? -(var_1_19 + var_1_20) : (var_1_19 + var_1_20))) - var_1_21) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=-5, var_1_16=5, var_1_17=0, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L119] var_1_24 = 16 VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=-5, var_1_16=5, var_1_17=0, var_1_1=32, var_1_24=16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L120] COND TRUE var_1_18 <= (var_1_3 - var_1_4) [L121] var_1_1 = var_1_5 VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=-5, var_1_16=5, var_1_17=0, var_1_1=-2, var_1_24=16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L125] COND FALSE !(\read(var_1_8)) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=-5, var_1_16=5, var_1_17=0, var_1_1=-2, var_1_24=16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L205] RET step() [L206] CALL, EXPR property() [L196-L197] return ((((((((var_1_18 <= (var_1_3 - var_1_4)) ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) && (var_1_8 ? ((var_1_5 < 16) ? (var_1_7 == ((unsigned long int) (var_1_6 + var_1_24))) : 1) : 1)) && (var_1_9 == ((signed long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) && ((var_1_6 < 10) ? ((var_1_5 < (56016 - var_1_11)) ? (var_1_10 == ((unsigned short int) var_1_5)) : 1) : 1)) && (((var_1_13 - var_1_14) > (var_1_10 + var_1_11)) ? ((! var_1_8) ? (var_1_12 == ((signed short int) var_1_13)) : 1) : (var_1_12 == ((signed short int) var_1_14)))) && (var_1_15 == ((signed short int) (var_1_14 - (((((var_1_16 + var_1_17)) > (4)) ? ((var_1_16 + var_1_17)) : (4))))))) && ((var_1_4 > var_1_2) ? (var_1_18 == ((float) (((((var_1_19 + var_1_20) < 0 ) ? -(var_1_19 + var_1_20) : (var_1_19 + var_1_20))) - var_1_21))) : ((! ((var_1_17 - var_1_11) < 128)) ? (var_1_18 == ((float) ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : (var_1_18 == ((float) ((((((((9.75f) > (var_1_19)) ? (9.75f) : (var_1_19)))) < ((((((var_1_21 - var_1_22)) > (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23))))) ? ((var_1_21 - var_1_22)) : (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23)))))))) ? (((((9.75f) > (var_1_19)) ? (9.75f) : (var_1_19)))) : ((((((var_1_21 - var_1_22)) > (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23))))) ? ((var_1_21 - var_1_22)) : (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23)))))))))))))) && (var_1_24 == ((signed short int) 16)) ; [L206] RET, EXPR property() [L206] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=-5, var_1_16=5, var_1_17=0, var_1_1=-2, var_1_24=16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L19] reach_error() VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_15=-5, var_1_16=5, var_1_17=0, var_1_1=-2, var_1_24=16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-2, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 12, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2124 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2043 mSDsluCounter, 5488 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3596 mSDsCounter, 348 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2439 IncrementalHoareTripleChecker+Invalid, 2787 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 348 mSolverCounterUnsat, 1892 mSDtfsCounter, 2439 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1355 GetRequests, 1287 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=489occurred in iteration=10, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 312 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 3024 NumberOfCodeBlocks, 3024 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3009 ConstructedInterpolants, 0 QuantifiedInterpolants, 12388 SizeOfPredicates, 2 NumberOfNonLiveVariables, 522 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 30859/30940 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-10-14 10:34:51,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.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 93ab9944ae60dcd2ea1c66f43a88f1592af9bef96260d06a583314616c867c3e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:34:54,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:34:54,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 10:34:54,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:34:54,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:34:54,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:34:54,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:34:54,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:34:54,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:34:54,203 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:34:54,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:34:54,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:34:54,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:34:54,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:34:54,204 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:34:54,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:34:54,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:34:54,204 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:34:54,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:34:54,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:34:54,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:34:54,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:34:54,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:34:54,211 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 10:34:54,211 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 10:34:54,212 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:34:54,212 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 10:34:54,212 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:34:54,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:34:54,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:34:54,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:34:54,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:34:54,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:34:54,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:34:54,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:34:54,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:34:54,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:34:54,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:34:54,213 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 10:34:54,213 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 10:34:54,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:34:54,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:34:54,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:34:54,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:34:54,219 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 10:34:54,219 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 -> 93ab9944ae60dcd2ea1c66f43a88f1592af9bef96260d06a583314616c867c3e [2024-10-14 10:34:54,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:34:54,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:34:54,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:34:54,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:34:54,555 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:34:54,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i [2024-10-14 10:34:56,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:34:56,277 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:34:56,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i [2024-10-14 10:34:56,289 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3733d256d/8355e04deccc4b6fb895266fb8db5385/FLAG311c095de [2024-10-14 10:34:56,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3733d256d/8355e04deccc4b6fb895266fb8db5385 [2024-10-14 10:34:56,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:34:56,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:34:56,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:34:56,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:34:56,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:34:56,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:34:56" (1/1) ... [2024-10-14 10:34:56,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57891448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:56, skipping insertion in model container [2024-10-14 10:34:56,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:34:56" (1/1) ... [2024-10-14 10:34:56,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:34:56,516 WARN L248 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-ps-co_file-7.i[918,931] [2024-10-14 10:34:56,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:34:56,625 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:34:56,636 WARN L248 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-ps-co_file-7.i[918,931] [2024-10-14 10:34:56,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:34:56,701 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:34:56,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:56 WrapperNode [2024-10-14 10:34:56,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:34:56,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:34:56,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:34:56,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:34:56,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:56" (1/1) ... [2024-10-14 10:34:56,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:56" (1/1) ... [2024-10-14 10:34:56,755 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 225 [2024-10-14 10:34:56,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:34:56,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:34:56,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:34:56,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:34:56,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:56" (1/1) ... [2024-10-14 10:34:56,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:56" (1/1) ... [2024-10-14 10:34:56,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:56" (1/1) ... [2024-10-14 10:34:56,789 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-10-14 10:34:56,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:56" (1/1) ... [2024-10-14 10:34:56,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:56" (1/1) ... [2024-10-14 10:34:56,803 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:56" (1/1) ... [2024-10-14 10:34:56,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:56" (1/1) ... [2024-10-14 10:34:56,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:56" (1/1) ... [2024-10-14 10:34:56,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:56" (1/1) ... [2024-10-14 10:34:56,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:34:56,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:34:56,832 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:34:56,832 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:34:56,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:56" (1/1) ... [2024-10-14 10:34:56,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:34:56,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:34:56,872 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-10-14 10:34:56,878 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-10-14 10:34:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:34:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 10:34:56,925 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:34:56,925 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:34:56,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:34:56,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:34:57,107 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:34:57,112 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:34:59,699 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 10:34:59,699 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:34:59,740 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:34:59,743 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:34:59,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:34:59 BoogieIcfgContainer [2024-10-14 10:34:59,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:34:59,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:34:59,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:34:59,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:34:59,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:34:56" (1/3) ... [2024-10-14 10:34:59,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5aedcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:34:59, skipping insertion in model container [2024-10-14 10:34:59,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:56" (2/3) ... [2024-10-14 10:34:59,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5aedcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:34:59, skipping insertion in model container [2024-10-14 10:34:59,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:34:59" (3/3) ... [2024-10-14 10:34:59,754 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i [2024-10-14 10:34:59,769 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:34:59,769 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:34:59,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:34:59,825 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;@31d9c89f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:34:59,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:34:59,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 10:34:59,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-14 10:34:59,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:59,861 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:34:59,862 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:59,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:59,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1150688908, now seen corresponding path program 1 times [2024-10-14 10:34:59,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:34:59,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258046780] [2024-10-14 10:34:59,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:59,878 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-10-14 10:34:59,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:34:59,881 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-10-14 10:34:59,895 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-10-14 10:35:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 10:35:00,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:35:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 968 proven. 0 refuted. 0 times theorem prover too weak. 1412 trivial. 0 not checked. [2024-10-14 10:35:00,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:35:00,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:35:00,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258046780] [2024-10-14 10:35:00,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258046780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:35:00,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:35:00,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:35:00,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284729245] [2024-10-14 10:35:00,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:35:00,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:35:00,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:35:00,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:35:00,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:35:00,426 INFO L87 Difference]: Start difference. First operand has 94 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-14 10:35:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:35:01,098 INFO L93 Difference]: Finished difference Result 185 states and 329 transitions. [2024-10-14 10:35:01,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:35:01,113 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 218 [2024-10-14 10:35:01,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:35:01,119 INFO L225 Difference]: With dead ends: 185 [2024-10-14 10:35:01,119 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 10:35:01,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 217 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-10-14 10:35:01,125 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 10:35:01,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 10:35:01,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 10:35:01,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-14 10:35:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 55 states have internal predecessors, (73), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 10:35:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 143 transitions. [2024-10-14 10:35:01,174 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 143 transitions. Word has length 218 [2024-10-14 10:35:01,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:35:01,175 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 143 transitions. [2024-10-14 10:35:01,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-14 10:35:01,175 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 143 transitions. [2024-10-14 10:35:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-14 10:35:01,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:35:01,182 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:35:01,207 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-10-14 10:35:01,382 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-10-14 10:35:01,383 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:35:01,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:35:01,384 INFO L85 PathProgramCache]: Analyzing trace with hash 161108638, now seen corresponding path program 1 times [2024-10-14 10:35:01,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:35:01,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514696915] [2024-10-14 10:35:01,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:35:01,385 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-10-14 10:35:01,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:35:01,390 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-10-14 10:35:01,392 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-10-14 10:35:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:01,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 10:35:01,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:35:02,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 10:35:02,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:35:02,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:35:02,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514696915] [2024-10-14 10:35:02,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1514696915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:35:02,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:35:02,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:35:02,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664720653] [2024-10-14 10:35:02,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:35:02,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:35:02,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:35:02,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:35:02,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:35:02,559 INFO L87 Difference]: Start difference. First operand 92 states and 143 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:35:03,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:35:03,567 INFO L93 Difference]: Finished difference Result 266 states and 416 transitions. [2024-10-14 10:35:03,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:35:03,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 218 [2024-10-14 10:35:03,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:35:03,571 INFO L225 Difference]: With dead ends: 266 [2024-10-14 10:35:03,571 INFO L226 Difference]: Without dead ends: 175 [2024-10-14 10:35:03,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 216 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-10-14 10:35:03,572 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 29 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:35:03,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 275 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 10:35:03,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-14 10:35:03,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 160. [2024-10-14 10:35:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 87 states have internal predecessors, (107), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 10:35:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 247 transitions. [2024-10-14 10:35:03,595 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 247 transitions. Word has length 218 [2024-10-14 10:35:03,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:35:03,596 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 247 transitions. [2024-10-14 10:35:03,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:35:03,597 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 247 transitions. [2024-10-14 10:35:03,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-14 10:35:03,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:35:03,599 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:35:03,616 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-10-14 10:35:03,803 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-10-14 10:35:03,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:35:03,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:35:03,805 INFO L85 PathProgramCache]: Analyzing trace with hash -320634417, now seen corresponding path program 1 times [2024-10-14 10:35:03,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:35:03,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408322996] [2024-10-14 10:35:03,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:35:03,806 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-10-14 10:35:03,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:35:03,808 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-10-14 10:35:03,810 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-10-14 10:35:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:04,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 10:35:04,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:35:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 10:35:04,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:35:04,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:35:04,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408322996] [2024-10-14 10:35:04,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408322996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:35:04,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:35:04,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:35:04,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978463358] [2024-10-14 10:35:04,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:35:04,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:35:04,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:35:04,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:35:04,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:35:04,716 INFO L87 Difference]: Start difference. First operand 160 states and 247 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:35:05,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:35:05,428 INFO L93 Difference]: Finished difference Result 263 states and 410 transitions. [2024-10-14 10:35:05,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:35:05,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 219 [2024-10-14 10:35:05,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:35:05,431 INFO L225 Difference]: With dead ends: 263 [2024-10-14 10:35:05,431 INFO L226 Difference]: Without dead ends: 172 [2024-10-14 10:35:05,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 217 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-10-14 10:35:05,432 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 21 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 10:35:05,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 276 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 10:35:05,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-14 10:35:05,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 163. [2024-10-14 10:35:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 90 states have internal predecessors, (112), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 10:35:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 252 transitions. [2024-10-14 10:35:05,451 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 252 transitions. Word has length 219 [2024-10-14 10:35:05,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:35:05,452 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 252 transitions. [2024-10-14 10:35:05,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:35:05,452 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 252 transitions. [2024-10-14 10:35:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-14 10:35:05,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:35:05,454 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:35:05,467 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-10-14 10:35:05,655 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-10-14 10:35:05,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:35:05,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:35:05,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1903216935, now seen corresponding path program 1 times [2024-10-14 10:35:05,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:35:05,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858304929] [2024-10-14 10:35:05,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:35:05,657 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-10-14 10:35:05,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:35:05,659 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-10-14 10:35:05,660 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-10-14 10:35:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:06,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 10:35:06,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:35:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 10:35:08,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:35:08,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:35:08,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858304929] [2024-10-14 10:35:08,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858304929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:35:08,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:35:08,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:35:08,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896047471] [2024-10-14 10:35:08,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:35:08,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:35:08,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:35:08,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:35:08,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:35:08,533 INFO L87 Difference]: Start difference. First operand 163 states and 252 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:35:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:35:10,253 INFO L93 Difference]: Finished difference Result 262 states and 406 transitions. [2024-10-14 10:35:10,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:35:10,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 220 [2024-10-14 10:35:10,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:35:10,259 INFO L225 Difference]: With dead ends: 262 [2024-10-14 10:35:10,260 INFO L226 Difference]: Without dead ends: 167 [2024-10-14 10:35:10,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 218 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-10-14 10:35:10,261 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 14 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 10:35:10,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 254 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 10:35:10,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-14 10:35:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2024-10-14 10:35:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 90 states have internal predecessors, (111), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 10:35:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 251 transitions. [2024-10-14 10:35:10,286 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 251 transitions. Word has length 220 [2024-10-14 10:35:10,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:35:10,286 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 251 transitions. [2024-10-14 10:35:10,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:35:10,287 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 251 transitions. [2024-10-14 10:35:10,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-14 10:35:10,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:35:10,289 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:35:10,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 10:35:10,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:35:10,490 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:35:10,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:35:10,491 INFO L85 PathProgramCache]: Analyzing trace with hash 89152661, now seen corresponding path program 1 times [2024-10-14 10:35:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:35:10,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347578471] [2024-10-14 10:35:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:35:10,492 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-10-14 10:35:10,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:35:10,497 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:35:10,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 10:35:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:10,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 10:35:10,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:35:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 984 proven. 27 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2024-10-14 10:35:11,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:35:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 75 proven. 27 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-10-14 10:35:11,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:35:11,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347578471] [2024-10-14 10:35:11,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347578471] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:35:11,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 10:35:11,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2024-10-14 10:35:11,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374098212] [2024-10-14 10:35:11,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 10:35:11,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 10:35:11,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:35:11,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 10:35:11,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 10:35:11,830 INFO L87 Difference]: Start difference. First operand 163 states and 251 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 4 states have call successors, (70), 3 states have call predecessors, (70), 5 states have return successors, (70), 4 states have call predecessors, (70), 4 states have call successors, (70) [2024-10-14 10:35:16,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:35:16,383 INFO L93 Difference]: Finished difference Result 485 states and 739 transitions. [2024-10-14 10:35:16,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 10:35:16,384 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 4 states have call successors, (70), 3 states have call predecessors, (70), 5 states have return successors, (70), 4 states have call predecessors, (70), 4 states have call successors, (70) Word has length 221 [2024-10-14 10:35:16,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:35:16,387 INFO L225 Difference]: With dead ends: 485 [2024-10-14 10:35:16,387 INFO L226 Difference]: Without dead ends: 393 [2024-10-14 10:35:16,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2024-10-14 10:35:16,388 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 414 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-14 10:35:16,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 385 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-14 10:35:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-14 10:35:16,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 323. [2024-10-14 10:35:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 187 states have (on average 1.267379679144385) internal successors, (237), 188 states have internal predecessors, (237), 129 states have call successors, (129), 6 states have call predecessors, (129), 6 states have return successors, (129), 128 states have call predecessors, (129), 129 states have call successors, (129) [2024-10-14 10:35:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 495 transitions. [2024-10-14 10:35:16,424 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 495 transitions. Word has length 221 [2024-10-14 10:35:16,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:35:16,424 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 495 transitions. [2024-10-14 10:35:16,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 4 states have call successors, (70), 3 states have call predecessors, (70), 5 states have return successors, (70), 4 states have call predecessors, (70), 4 states have call successors, (70) [2024-10-14 10:35:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 495 transitions. [2024-10-14 10:35:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-14 10:35:16,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:35:16,427 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:35:16,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 10:35:16,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:35:16,631 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:35:16,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:35:16,632 INFO L85 PathProgramCache]: Analyzing trace with hash 12699909, now seen corresponding path program 1 times [2024-10-14 10:35:16,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:35:16,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390664836] [2024-10-14 10:35:16,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:35:16,632 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-10-14 10:35:16,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:35:16,634 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:35:16,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 10:35:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:17,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 10:35:17,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:35:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 10:35:17,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:35:17,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:35:17,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390664836] [2024-10-14 10:35:17,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390664836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:35:17,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:35:17,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:35:17,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921418968] [2024-10-14 10:35:17,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:35:17,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:35:17,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:35:17,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:35:17,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:35:17,110 INFO L87 Difference]: Start difference. First operand 323 states and 495 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:35:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:35:18,661 INFO L93 Difference]: Finished difference Result 771 states and 1184 transitions. [2024-10-14 10:35:18,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:35:18,662 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 222 [2024-10-14 10:35:18,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:35:18,671 INFO L225 Difference]: With dead ends: 771 [2024-10-14 10:35:18,671 INFO L226 Difference]: Without dead ends: 524 [2024-10-14 10:35:18,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 220 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-10-14 10:35:18,677 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 103 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 10:35:18,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 270 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 10:35:18,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-10-14 10:35:18,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 513. [2024-10-14 10:35:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 299 states have (on average 1.274247491638796) internal successors, (381), 303 states have internal predecessors, (381), 203 states have call successors, (203), 10 states have call predecessors, (203), 10 states have return successors, (203), 199 states have call predecessors, (203), 203 states have call successors, (203) [2024-10-14 10:35:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 787 transitions. [2024-10-14 10:35:18,743 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 787 transitions. Word has length 222 [2024-10-14 10:35:18,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:35:18,744 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 787 transitions. [2024-10-14 10:35:18,744 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 10:35:18,744 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 787 transitions. [2024-10-14 10:35:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-14 10:35:18,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:35:18,746 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 10:35:18,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-14 10:35:18,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:35:18,947 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:35:18,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:35:18,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1023817159, now seen corresponding path program 1 times [2024-10-14 10:35:18,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:35:18,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091931093] [2024-10-14 10:35:18,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:35:18,948 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-10-14 10:35:18,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:35:18,952 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:35:18,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 10:35:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:19,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 10:35:19,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:35:37,285 WARN L286 SmtUtils]: Spent 7.53s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-14 10:35:55,001 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)