./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.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 431f2117f5c677d2ffce2fa99499007e44687a7dec4f669e88843242de06006b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:07:22,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:07:22,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:07:22,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:07:22,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:07:22,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:07:22,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:07:22,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:07:22,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:07:22,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:07:22,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:07:22,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:07:22,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:07:22,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:07:22,471 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:07:22,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:07:22,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:07:22,472 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:07:22,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:07:22,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:07:22,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:07:22,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:07:22,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:07:22,473 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:07:22,473 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:07:22,473 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:07:22,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:07:22,474 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:07:22,474 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:07:22,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:07:22,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:07:22,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:07:22,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:07:22,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:07:22,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:07:22,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:07:22,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:07:22,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:07:22,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:07:22,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:07:22,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:07:22,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:07:22,477 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 -> 431f2117f5c677d2ffce2fa99499007e44687a7dec4f669e88843242de06006b [2024-11-10 04:07:22,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:07:22,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:07:22,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:07:22,714 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:07:22,715 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:07:22,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i [2024-11-10 04:07:23,980 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:07:24,171 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:07:24,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i [2024-11-10 04:07:24,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c98b8b46/4396cdb7fb2241c6a33ae06d60c766a8/FLAG6e4ac67c9 [2024-11-10 04:07:24,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c98b8b46/4396cdb7fb2241c6a33ae06d60c766a8 [2024-11-10 04:07:24,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:07:24,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:07:24,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:07:24,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:07:24,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:07:24,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:07:24" (1/1) ... [2024-11-10 04:07:24,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7260d90c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:24, skipping insertion in model container [2024-11-10 04:07:24,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:07:24" (1/1) ... [2024-11-10 04:07:24,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:07:24,374 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i[915,928] [2024-11-10 04:07:24,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:07:24,443 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:07:24,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i[915,928] [2024-11-10 04:07:24,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:07:24,543 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:07:24,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:24 WrapperNode [2024-11-10 04:07:24,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:07:24,544 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:07:24,544 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:07:24,544 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:07:24,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:24" (1/1) ... [2024-11-10 04:07:24,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:24" (1/1) ... [2024-11-10 04:07:24,594 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2024-11-10 04:07:24,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:07:24,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:07:24,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:07:24,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:07:24,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:24" (1/1) ... [2024-11-10 04:07:24,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:24" (1/1) ... [2024-11-10 04:07:24,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:24" (1/1) ... [2024-11-10 04:07:24,634 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:07:24,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:24" (1/1) ... [2024-11-10 04:07:24,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:24" (1/1) ... [2024-11-10 04:07:24,649 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:24" (1/1) ... [2024-11-10 04:07:24,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:24" (1/1) ... [2024-11-10 04:07:24,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:24" (1/1) ... [2024-11-10 04:07:24,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:24" (1/1) ... [2024-11-10 04:07:24,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:07:24,660 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:07:24,661 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:07:24,661 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:07:24,667 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:24" (1/1) ... [2024-11-10 04:07:24,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:07:24,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:07:24,702 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:07:24,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:07:24,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:07:24,739 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:07:24,740 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:07:24,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:07:24,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:07:24,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:07:24,807 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:07:24,808 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:07:25,085 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L160: havoc property_#t~bitwise21#1;havoc property_#t~short22#1;havoc property_#t~bitwise23#1;havoc property_#t~short24#1; [2024-11-10 04:07:25,123 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 04:07:25,123 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:07:25,149 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:07:25,150 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:07:25,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:07:25 BoogieIcfgContainer [2024-11-10 04:07:25,150 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:07:25,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:07:25,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:07:25,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:07:25,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:07:24" (1/3) ... [2024-11-10 04:07:25,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7353280f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:07:25, skipping insertion in model container [2024-11-10 04:07:25,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:24" (2/3) ... [2024-11-10 04:07:25,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7353280f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:07:25, skipping insertion in model container [2024-11-10 04:07:25,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:07:25" (3/3) ... [2024-11-10 04:07:25,157 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-65.i [2024-11-10 04:07:25,170 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:07:25,170 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:07:25,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:07:25,233 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;@5f1dfd78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:07:25,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:07:25,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 71 states have internal predecessors, (100), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 04:07:25,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 04:07:25,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:07:25,256 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:07:25,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:07:25,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:07:25,261 INFO L85 PathProgramCache]: Analyzing trace with hash 749336432, now seen corresponding path program 1 times [2024-11-10 04:07:25,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:07:25,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517787870] [2024-11-10 04:07:25,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:07:25,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:07:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:07:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:07:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:07:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:07:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:07:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:07:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:07:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:07:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:07:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:07:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:07:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:07:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:07:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:07:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:07:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:07:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:07:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:07:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:07:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:07:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:07:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:07:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:07:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:07:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:07:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 04:07:25,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:07:25,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517787870] [2024-11-10 04:07:25,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517787870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:07:25,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:07:25,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:07:25,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853150720] [2024-11-10 04:07:25,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:07:25,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:07:25,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:07:25,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:07:25,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:07:25,758 INFO L87 Difference]: Start difference. First operand has 98 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 71 states have internal predecessors, (100), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 04:07:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:07:25,799 INFO L93 Difference]: Finished difference Result 186 states and 316 transitions. [2024-11-10 04:07:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:07:25,802 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 166 [2024-11-10 04:07:25,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:07:25,810 INFO L225 Difference]: With dead ends: 186 [2024-11-10 04:07:25,810 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 04:07:25,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:07:25,818 INFO L432 NwaCegarLoop]: 134 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, 134 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-11-10 04:07:25,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:07:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 04:07:25,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-10 04:07:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.359375) internal successors, (87), 64 states have internal predecessors, (87), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 04:07:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 137 transitions. [2024-11-10 04:07:25,863 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 137 transitions. Word has length 166 [2024-11-10 04:07:25,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:07:25,864 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 137 transitions. [2024-11-10 04:07:25,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 04:07:25,864 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 137 transitions. [2024-11-10 04:07:25,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 04:07:25,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:07:25,867 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:07:25,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:07:25,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:07:25,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:07:25,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1924770899, now seen corresponding path program 1 times [2024-11-10 04:07:25,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:07:25,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598954449] [2024-11-10 04:07:25,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:07:25,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:07:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:07:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:07:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:07:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:07:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:07:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:07:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:07:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:07:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:07:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:07:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:07:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:07:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:07:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:07:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:07:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:07:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:07:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:07:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:07:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:07:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:07:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:07:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:07:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:07:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:07:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 04:07:26,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:07:26,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598954449] [2024-11-10 04:07:26,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598954449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:07:26,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:07:26,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:07:26,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329726292] [2024-11-10 04:07:26,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:07:26,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:07:26,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:07:26,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:07:26,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:07:26,191 INFO L87 Difference]: Start difference. First operand 91 states and 137 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 04:07:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:07:26,298 INFO L93 Difference]: Finished difference Result 267 states and 405 transitions. [2024-11-10 04:07:26,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:07:26,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2024-11-10 04:07:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:07:26,301 INFO L225 Difference]: With dead ends: 267 [2024-11-10 04:07:26,301 INFO L226 Difference]: Without dead ends: 179 [2024-11-10 04:07:26,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:07:26,307 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 121 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:07:26,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 354 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:07:26,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-10 04:07:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 108. [2024-11-10 04:07:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 04:07:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 161 transitions. [2024-11-10 04:07:26,331 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 161 transitions. Word has length 166 [2024-11-10 04:07:26,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:07:26,333 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 161 transitions. [2024-11-10 04:07:26,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 04:07:26,334 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 161 transitions. [2024-11-10 04:07:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-10 04:07:26,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:07:26,336 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:07:26,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:07:26,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:07:26,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:07:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash 672393057, now seen corresponding path program 1 times [2024-11-10 04:07:26,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:07:26,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270214555] [2024-11-10 04:07:26,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:07:26,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:07:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:07:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:07:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:07:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:07:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:07:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:07:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:07:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:07:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:07:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:07:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:07:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:07:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:07:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:07:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:07:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:07:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:07:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:07:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:07:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:07:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:07:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:07:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:07:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:07:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:07:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:26,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 04:07:26,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:07:26,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270214555] [2024-11-10 04:07:26,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270214555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:07:26,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:07:26,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:07:26,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046831130] [2024-11-10 04:07:26,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:07:26,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:07:26,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:07:26,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:07:26,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:07:26,500 INFO L87 Difference]: Start difference. First operand 108 states and 161 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 04:07:26,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:07:26,526 INFO L93 Difference]: Finished difference Result 194 states and 287 transitions. [2024-11-10 04:07:26,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:07:26,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-10 04:07:26,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:07:26,529 INFO L225 Difference]: With dead ends: 194 [2024-11-10 04:07:26,529 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 04:07:26,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:07:26,530 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:07:26,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:07:26,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 04:07:26,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-10 04:07:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 62 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 04:07:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2024-11-10 04:07:26,538 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 167 [2024-11-10 04:07:26,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:07:26,539 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2024-11-10 04:07:26,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 04:07:26,539 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-11-10 04:07:26,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-10 04:07:26,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:07:26,544 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:07:26,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:07:26,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:07:26,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:07:26,545 INFO L85 PathProgramCache]: Analyzing trace with hash 403385040, now seen corresponding path program 1 times [2024-11-10 04:07:26,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:07:26,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797104984] [2024-11-10 04:07:26,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:07:26,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:07:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:07:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:07:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:07:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:07:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:07:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:07:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:07:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:07:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:07:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:07:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:07:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:07:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:07:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:07:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:07:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:07:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:07:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:07:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:07:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:07:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:07:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:07:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:07:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:07:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:07:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 04:07:27,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:07:27,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797104984] [2024-11-10 04:07:27,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797104984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:07:27,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:07:27,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 04:07:27,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551029912] [2024-11-10 04:07:27,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:07:27,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 04:07:27,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:07:27,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 04:07:27,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 04:07:27,326 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 04:07:27,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:07:27,653 INFO L93 Difference]: Finished difference Result 302 states and 442 transitions. [2024-11-10 04:07:27,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 04:07:27,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2024-11-10 04:07:27,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:07:27,655 INFO L225 Difference]: With dead ends: 302 [2024-11-10 04:07:27,657 INFO L226 Difference]: Without dead ends: 216 [2024-11-10 04:07:27,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:07:27,658 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 281 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:07:27,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 709 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:07:27,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-10 04:07:27,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 91. [2024-11-10 04:07:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.25) internal successors, (80), 64 states have internal predecessors, (80), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 04:07:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2024-11-10 04:07:27,669 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 168 [2024-11-10 04:07:27,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:07:27,669 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2024-11-10 04:07:27,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 04:07:27,670 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2024-11-10 04:07:27,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 04:07:27,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:07:27,671 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:07:27,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:07:27,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:07:27,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:07:27,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1742907868, now seen corresponding path program 1 times [2024-11-10 04:07:27,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:07:27,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481971510] [2024-11-10 04:07:27,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:07:27,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:07:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:07:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:07:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:07:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:07:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:07:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:07:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:07:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:07:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:07:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:07:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:07:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:07:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:07:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:07:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:07:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:07:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:07:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:07:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:07:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:07:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:07:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:07:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:07:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:07:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:07:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 04:07:28,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:07:28,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481971510] [2024-11-10 04:07:28,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481971510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:07:28,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:07:28,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 04:07:28,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538012363] [2024-11-10 04:07:28,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:07:28,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 04:07:28,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:07:28,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 04:07:28,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:07:28,324 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-10 04:07:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:07:28,662 INFO L93 Difference]: Finished difference Result 209 states and 297 transitions. [2024-11-10 04:07:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 04:07:28,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 169 [2024-11-10 04:07:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:07:28,668 INFO L225 Difference]: With dead ends: 209 [2024-11-10 04:07:28,668 INFO L226 Difference]: Without dead ends: 121 [2024-11-10 04:07:28,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:07:28,669 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 235 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 04:07:28,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 251 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 04:07:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-10 04:07:28,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-10 04:07:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 80 states have internal predecessors, (94), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 04:07:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2024-11-10 04:07:28,692 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 169 [2024-11-10 04:07:28,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:07:28,692 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2024-11-10 04:07:28,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-10 04:07:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2024-11-10 04:07:28,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 04:07:28,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:07:28,694 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:07:28,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 04:07:28,694 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:07:28,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:07:28,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1939421373, now seen corresponding path program 1 times [2024-11-10 04:07:28,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:07:28,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023143177] [2024-11-10 04:07:28,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:07:28,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:07:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:07:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:07:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:07:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:07:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:07:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:07:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:07:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:07:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:07:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:07:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:07:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:07:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:07:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:07:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:07:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:07:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:07:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:07:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:07:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:07:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:07:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:07:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:07:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:07:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:07:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 04:07:29,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:07:29,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023143177] [2024-11-10 04:07:29,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023143177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:07:29,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:07:29,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 04:07:29,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576750514] [2024-11-10 04:07:29,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:07:29,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 04:07:29,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:07:29,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 04:07:29,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:07:29,409 INFO L87 Difference]: Start difference. First operand 120 states and 168 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 04:07:29,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:07:29,806 INFO L93 Difference]: Finished difference Result 332 states and 462 transitions. [2024-11-10 04:07:29,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 04:07:29,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 169 [2024-11-10 04:07:29,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:07:29,809 INFO L225 Difference]: With dead ends: 332 [2024-11-10 04:07:29,809 INFO L226 Difference]: Without dead ends: 236 [2024-11-10 04:07:29,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-10 04:07:29,810 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 268 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 04:07:29,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 863 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 04:07:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-10 04:07:29,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 146. [2024-11-10 04:07:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 90 states have (on average 1.1555555555555554) internal successors, (104), 91 states have internal predecessors, (104), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-10 04:07:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 204 transitions. [2024-11-10 04:07:29,840 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 204 transitions. Word has length 169 [2024-11-10 04:07:29,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:07:29,841 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 204 transitions. [2024-11-10 04:07:29,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 04:07:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 204 transitions. [2024-11-10 04:07:29,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-10 04:07:29,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:07:29,842 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:07:29,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 04:07:29,842 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:07:29,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:07:29,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1045649429, now seen corresponding path program 1 times [2024-11-10 04:07:29,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:07:29,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441833994] [2024-11-10 04:07:29,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:07:29,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:07:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:07:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:07:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:07:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:07:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:07:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:07:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:07:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:07:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:07:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:07:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:07:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:07:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:07:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:07:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:07:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:07:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:07:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:07:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:07:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:07:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:07:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:07:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:07:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:07:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:07:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-10 04:07:30,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:07:30,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441833994] [2024-11-10 04:07:30,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441833994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:07:30,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196146849] [2024-11-10 04:07:30,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:07:30,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:07:30,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:07:30,160 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:07:30,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 04:07:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:30,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 04:07:30,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:07:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 468 proven. 54 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-10 04:07:30,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:07:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-10 04:07:30,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196146849] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:07:30,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:07:30,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-10 04:07:30,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167290650] [2024-11-10 04:07:30,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:07:30,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 04:07:30,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:07:30,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 04:07:30,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-10 04:07:30,764 INFO L87 Difference]: Start difference. First operand 146 states and 204 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-10 04:07:31,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:07:31,038 INFO L93 Difference]: Finished difference Result 260 states and 350 transitions. [2024-11-10 04:07:31,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 04:07:31,039 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 172 [2024-11-10 04:07:31,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:07:31,041 INFO L225 Difference]: With dead ends: 260 [2024-11-10 04:07:31,041 INFO L226 Difference]: Without dead ends: 166 [2024-11-10 04:07:31,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 390 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2024-11-10 04:07:31,042 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 135 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:07:31,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 240 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:07:31,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-10 04:07:31,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 158. [2024-11-10 04:07:31,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 99 states have (on average 1.1313131313131313) internal successors, (112), 100 states have internal predecessors, (112), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-10 04:07:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 212 transitions. [2024-11-10 04:07:31,077 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 212 transitions. Word has length 172 [2024-11-10 04:07:31,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:07:31,078 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 212 transitions. [2024-11-10 04:07:31,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-10 04:07:31,079 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 212 transitions. [2024-11-10 04:07:31,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-10 04:07:31,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:07:31,080 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:07:31,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 04:07:31,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:07:31,286 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:07:31,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:07:31,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1445625080, now seen corresponding path program 1 times [2024-11-10 04:07:31,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:07:31,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523252391] [2024-11-10 04:07:31,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:07:31,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:07:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:07:31,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 04:07:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:07:31,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 04:07:31,467 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 04:07:31,467 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 04:07:31,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 04:07:31,471 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:07:31,580 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 04:07:31,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:07:31 BoogieIcfgContainer [2024-11-10 04:07:31,582 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 04:07:31,583 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 04:07:31,583 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 04:07:31,583 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 04:07:31,587 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:07:25" (3/4) ... [2024-11-10 04:07:31,590 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 04:07:31,591 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 04:07:31,591 INFO L158 Benchmark]: Toolchain (without parser) took 7392.20ms. Allocated memory was 195.0MB in the beginning and 302.0MB in the end (delta: 107.0MB). Free memory was 125.6MB in the beginning and 170.6MB in the end (delta: -45.0MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2024-11-10 04:07:31,591 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:07:31,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.64ms. Allocated memory is still 195.0MB. Free memory was 125.3MB in the beginning and 164.8MB in the end (delta: -39.5MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-11-10 04:07:31,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.14ms. Allocated memory is still 195.0MB. Free memory was 164.8MB in the beginning and 161.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:07:31,591 INFO L158 Benchmark]: Boogie Preprocessor took 64.93ms. Allocated memory is still 195.0MB. Free memory was 161.2MB in the beginning and 157.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:07:31,592 INFO L158 Benchmark]: IcfgBuilder took 489.74ms. Allocated memory is still 195.0MB. Free memory was 157.0MB in the beginning and 129.1MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 04:07:31,592 INFO L158 Benchmark]: TraceAbstraction took 6430.49ms. Allocated memory was 195.0MB in the beginning and 302.0MB in the end (delta: 107.0MB). Free memory was 128.4MB in the beginning and 171.7MB in the end (delta: -43.3MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2024-11-10 04:07:31,592 INFO L158 Benchmark]: Witness Printer took 8.05ms. Allocated memory is still 302.0MB. Free memory was 171.7MB in the beginning and 170.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 04:07:31,593 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.15ms. Allocated memory is still 104.9MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.64ms. Allocated memory is still 195.0MB. Free memory was 125.3MB in the beginning and 164.8MB in the end (delta: -39.5MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.14ms. Allocated memory is still 195.0MB. Free memory was 164.8MB in the beginning and 161.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.93ms. Allocated memory is still 195.0MB. Free memory was 161.2MB in the beginning and 157.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 489.74ms. Allocated memory is still 195.0MB. Free memory was 157.0MB in the beginning and 129.1MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6430.49ms. Allocated memory was 195.0MB in the beginning and 302.0MB in the end (delta: 107.0MB). Free memory was 128.4MB in the beginning and 171.7MB in the end (delta: -43.3MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. * Witness Printer took 8.05ms. Allocated memory is still 302.0MB. Free memory was 171.7MB in the beginning and 170.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryFLOATComparisonOperation at line 149, overapproximation of someBinaryArithmeticDOUBLEoperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_8 = 64; [L24] unsigned short int var_1_11 = 256; [L25] unsigned short int var_1_12 = 0; [L26] unsigned short int var_1_13 = 64; [L27] unsigned char var_1_14 = 1; [L28] unsigned char var_1_15 = 0; [L29] signed char var_1_16 = 50; [L30] signed char var_1_19 = -100; [L31] double var_1_20 = 100000000.8; [L32] double var_1_21 = 15.125; [L33] double var_1_22 = 99.22; [L34] signed long int var_1_23 = -16; [L35] unsigned char var_1_24 = 1; [L36] signed char var_1_25 = 10; [L37] signed char var_1_26 = 16; [L38] unsigned char var_1_27 = 0; [L39] double var_1_28 = 5.5; [L40] signed long int var_1_29 = 50; [L41] signed long int var_1_30 = 16; [L42] signed char var_1_31 = 4; [L43] signed char var_1_32 = 64; [L44] unsigned short int var_1_33 = 16; [L45] unsigned short int var_1_34 = 100; [L46] signed short int var_1_35 = -32; [L47] float var_1_36 = 99.05; [L48] float var_1_37 = 10.75; [L49] signed short int last_1_var_1_1 = 4; [L50] unsigned char last_1_var_1_14 = 1; [L51] signed char last_1_var_1_16 = 50; [L52] signed long int last_1_var_1_23 = -16; [L53] unsigned char last_1_var_1_24 = 1; [L54] double last_1_var_1_28 = 5.5; VAL [isInitial=0, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L164] isInitial = 1 [L165] FCALL initially() [L166] COND TRUE 1 [L167] CALL updateLastVariables() [L152] last_1_var_1_1 = var_1_1 [L153] last_1_var_1_14 = var_1_14 [L154] last_1_var_1_16 = var_1_16 [L155] last_1_var_1_23 = var_1_23 [L156] last_1_var_1_24 = var_1_24 [L157] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L167] RET updateLastVariables() [L168] CALL updateVariables() [L111] var_1_11 = __VERIFIER_nondet_ushort() [L112] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L112] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L113] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L113] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L114] var_1_12 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L115] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L116] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L116] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L117] var_1_13 = __VERIFIER_nondet_ushort() [L118] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L118] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L119] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L119] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L120] var_1_15 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L121] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L122] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L122] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L123] var_1_19 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L124] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L125] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L125] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L126] var_1_21 = __VERIFIER_nondet_double() [L127] 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, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L127] 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, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L128] var_1_22 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L129] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L130] var_1_25 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L131] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L132] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L132] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L133] var_1_26 = __VERIFIER_nondet_char() [L134] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L134] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L135] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L135] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L136] var_1_27 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L137] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L138] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L138] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=16, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L139] var_1_30 = __VERIFIER_nondet_long() [L140] CALL assume_abort_if_not(var_1_30 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L140] RET assume_abort_if_not(var_1_30 >= -2147483647) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L141] CALL assume_abort_if_not(var_1_30 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L141] RET assume_abort_if_not(var_1_30 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=64, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L142] var_1_32 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_32 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L143] RET assume_abort_if_not(var_1_32 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L144] CALL assume_abort_if_not(var_1_32 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L144] RET assume_abort_if_not(var_1_32 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=100, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L145] var_1_34 = __VERIFIER_nondet_ushort() [L146] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L146] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L147] CALL assume_abort_if_not(var_1_34 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=126, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=126, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L147] RET assume_abort_if_not(var_1_34 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=126, var_1_35=-32, var_1_36=1981/20, var_1_37=43/4, var_1_8=64] [L148] var_1_37 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_37 >= -922337.2036854765600e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=126, var_1_35=-32, var_1_36=1981/20, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=126, var_1_35=-32, var_1_36=1981/20, var_1_8=64] [L149] RET assume_abort_if_not((var_1_37 >= -922337.2036854765600e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=16, var_1_34=126, var_1_35=-32, var_1_36=1981/20, var_1_8=64] [L168] RET updateVariables() [L169] CALL step() [L58] var_1_29 = var_1_30 [L59] var_1_31 = var_1_32 [L60] var_1_33 = var_1_34 [L61] var_1_35 = var_1_32 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=1981/20, var_1_8=64] [L62] EXPR var_1_29 ^ var_1_34 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=1981/20, var_1_8=64] [L62] COND FALSE !(((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) < (var_1_29 ^ var_1_34)) [L69] var_1_36 = var_1_37 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L71] signed long int stepLocal_3 = last_1_var_1_23; [L72] unsigned char stepLocal_2 = ! (last_1_var_1_14 || last_1_var_1_14); VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L73] COND FALSE !(last_1_var_1_23 < stepLocal_3) [L84] var_1_16 = 100 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L86] EXPR ((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L86] COND TRUE (((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23 [L87] var_1_23 = (5 - var_1_12) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=5, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L91] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) [L92] var_1_28 = var_1_21 [L93] unsigned char stepLocal_0 = var_1_23 > 4; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_21=100000005, var_1_23=5, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L94] COND TRUE (var_1_23 <= var_1_23) || stepLocal_0 [L95] var_1_1 = (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L99] var_1_24 = ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27) [L100] signed char stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L101] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L101] COND TRUE stepLocal_1 > (var_1_23 + (var_1_16 ^ var_1_16)) [L102] var_1_14 = (var_1_24 || var_1_15) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L104] COND TRUE \read(var_1_14) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L105] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L169] RET step() [L170] CALL, EXPR property() [L160] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L160] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L160] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L160] EXPR (((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1)))))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L160-L161] return (((((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1))))))) && (var_1_24 == ((unsigned char) ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L170] RET, EXPR property() [L170] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_29=0, var_1_30=0, var_1_31=126, var_1_32=126, var_1_33=126, var_1_34=126, var_1_35=126, var_1_36=100000006, var_1_37=100000006, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 8, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1046 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1040 mSDsluCounter, 2791 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1469 mSDsCounter, 319 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 738 IncrementalHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 319 mSolverCounterUnsat, 1322 mSDtfsCounter, 738 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 775 GetRequests, 734 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=7, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 295 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1522 NumberOfCodeBlocks, 1522 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1512 ConstructedInterpolants, 0 QuantifiedInterpolants, 3764 SizeOfPredicates, 2 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 10638/10800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 04:07:31,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.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 431f2117f5c677d2ffce2fa99499007e44687a7dec4f669e88843242de06006b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:07:33,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:07:33,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 04:07:33,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:07:33,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:07:33,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:07:33,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:07:33,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:07:33,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:07:33,775 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:07:33,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:07:33,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:07:33,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:07:33,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:07:33,776 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:07:33,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:07:33,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:07:33,777 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:07:33,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:07:33,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:07:33,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:07:33,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:07:33,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:07:33,778 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 04:07:33,778 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 04:07:33,778 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:07:33,779 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 04:07:33,779 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:07:33,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:07:33,779 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:07:33,779 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:07:33,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:07:33,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:07:33,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:07:33,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:07:33,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:07:33,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:07:33,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:07:33,781 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 04:07:33,781 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 04:07:33,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:07:33,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:07:33,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:07:33,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:07:33,782 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 -> 431f2117f5c677d2ffce2fa99499007e44687a7dec4f669e88843242de06006b [2024-11-10 04:07:34,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:07:34,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:07:34,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:07:34,100 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:07:34,100 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:07:34,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i [2024-11-10 04:07:35,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:07:35,658 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:07:35,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i [2024-11-10 04:07:35,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e5f0ff0/276780c9b73642d48116589a4cce1c0d/FLAGe5c2f0e94 [2024-11-10 04:07:36,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e5f0ff0/276780c9b73642d48116589a4cce1c0d [2024-11-10 04:07:36,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:07:36,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:07:36,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:07:36,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:07:36,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:07:36,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:07:36" (1/1) ... [2024-11-10 04:07:36,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19ffa19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:36, skipping insertion in model container [2024-11-10 04:07:36,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:07:36" (1/1) ... [2024-11-10 04:07:36,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:07:36,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i[915,928] [2024-11-10 04:07:36,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:07:36,306 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:07:36,319 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-65.i[915,928] [2024-11-10 04:07:36,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:07:36,382 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:07:36,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:36 WrapperNode [2024-11-10 04:07:36,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:07:36,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:07:36,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:07:36,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:07:36,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:36" (1/1) ... [2024-11-10 04:07:36,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:36" (1/1) ... [2024-11-10 04:07:36,446 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2024-11-10 04:07:36,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:07:36,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:07:36,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:07:36,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:07:36,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:36" (1/1) ... [2024-11-10 04:07:36,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:36" (1/1) ... [2024-11-10 04:07:36,470 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:36" (1/1) ... [2024-11-10 04:07:36,488 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:07:36,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:36" (1/1) ... [2024-11-10 04:07:36,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:36" (1/1) ... [2024-11-10 04:07:36,502 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:36" (1/1) ... [2024-11-10 04:07:36,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:36" (1/1) ... [2024-11-10 04:07:36,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:36" (1/1) ... [2024-11-10 04:07:36,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:36" (1/1) ... [2024-11-10 04:07:36,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:07:36,509 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:07:36,510 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:07:36,510 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:07:36,510 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:36" (1/1) ... [2024-11-10 04:07:36,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:07:36,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:07:36,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:07:36,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:07:36,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:07:36,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 04:07:36,591 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:07:36,591 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:07:36,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:07:36,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:07:36,681 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:07:36,685 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:07:38,472 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-10 04:07:38,472 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:07:38,492 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:07:38,493 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:07:38,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:07:38 BoogieIcfgContainer [2024-11-10 04:07:38,493 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:07:38,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:07:38,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:07:38,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:07:38,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:07:36" (1/3) ... [2024-11-10 04:07:38,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2050c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:07:38, skipping insertion in model container [2024-11-10 04:07:38,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:36" (2/3) ... [2024-11-10 04:07:38,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2050c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:07:38, skipping insertion in model container [2024-11-10 04:07:38,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:07:38" (3/3) ... [2024-11-10 04:07:38,505 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-65.i [2024-11-10 04:07:38,519 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:07:38,519 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:07:38,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:07:38,584 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;@3b961514, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:07:38,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:07:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 04:07:38,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-10 04:07:38,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:07:38,599 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:07:38,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:07:38,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:07:38,604 INFO L85 PathProgramCache]: Analyzing trace with hash 114716012, now seen corresponding path program 1 times [2024-11-10 04:07:38,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:07:38,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92017731] [2024-11-10 04:07:38,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:07:38,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:07:38,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:07:38,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:07:38,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 04:07:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:38,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 04:07:38,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:07:39,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-11-10 04:07:39,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:07:39,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:07:39,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92017731] [2024-11-10 04:07:39,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92017731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:07:39,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:07:39,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:07:39,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707010817] [2024-11-10 04:07:39,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:07:39,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:07:39,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:07:39,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:07:39,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:07:39,050 INFO L87 Difference]: Start difference. First operand has 74 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 04:07:39,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:07:39,072 INFO L93 Difference]: Finished difference Result 140 states and 240 transitions. [2024-11-10 04:07:39,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:07:39,074 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 159 [2024-11-10 04:07:39,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:07:39,079 INFO L225 Difference]: With dead ends: 140 [2024-11-10 04:07:39,079 INFO L226 Difference]: Without dead ends: 69 [2024-11-10 04:07:39,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:07:39,085 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:07:39,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:07:39,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-10 04:07:39,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-10 04:07:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 04:07:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 102 transitions. [2024-11-10 04:07:39,119 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 102 transitions. Word has length 159 [2024-11-10 04:07:39,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:07:39,120 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 102 transitions. [2024-11-10 04:07:39,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 04:07:39,120 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 102 transitions. [2024-11-10 04:07:39,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-10 04:07:39,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:07:39,123 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:07:39,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 04:07:39,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:07:39,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:07:39,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:07:39,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1866932713, now seen corresponding path program 1 times [2024-11-10 04:07:39,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:07:39,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764824184] [2024-11-10 04:07:39,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:07:39,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:07:39,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:07:39,329 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:07:39,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 04:07:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:39,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 04:07:39,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:07:40,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 468 proven. 54 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-10 04:07:40,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:07:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-10 04:07:40,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:07:40,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764824184] [2024-11-10 04:07:40,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764824184] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:07:40,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 04:07:40,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-10 04:07:40,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20289184] [2024-11-10 04:07:40,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 04:07:40,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 04:07:40,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:07:40,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 04:07:40,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 04:07:40,419 INFO L87 Difference]: Start difference. First operand 69 states and 102 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-10 04:07:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:07:41,676 INFO L93 Difference]: Finished difference Result 155 states and 226 transitions. [2024-11-10 04:07:41,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 04:07:41,677 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 159 [2024-11-10 04:07:41,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:07:41,679 INFO L225 Difference]: With dead ends: 155 [2024-11-10 04:07:41,679 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 04:07:41,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 309 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-10 04:07:41,681 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 136 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:07:41,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 199 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 04:07:41,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 04:07:41,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2024-11-10 04:07:41,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.18) internal successors, (59), 51 states have internal predecessors, (59), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 04:07:41,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2024-11-10 04:07:41,699 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 159 [2024-11-10 04:07:41,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:07:41,699 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2024-11-10 04:07:41,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-10 04:07:41,700 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2024-11-10 04:07:41,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 04:07:41,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:07:41,702 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:07:41,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 04:07:41,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:07:41,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:07:41,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:07:41,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1183372348, now seen corresponding path program 1 times [2024-11-10 04:07:41,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:07:41,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226891523] [2024-11-10 04:07:41,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:07:41,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:07:41,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:07:41,910 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:07:41,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 04:07:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:42,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 04:07:42,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:07:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 534 proven. 21 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2024-11-10 04:07:42,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:07:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-10 04:07:42,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:07:42,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226891523] [2024-11-10 04:07:42,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226891523] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:07:42,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 04:07:42,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-10 04:07:42,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694652047] [2024-11-10 04:07:42,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 04:07:42,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 04:07:42,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:07:42,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 04:07:42,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 04:07:42,619 INFO L87 Difference]: Start difference. First operand 84 states and 121 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 04:07:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:07:44,015 INFO L93 Difference]: Finished difference Result 221 states and 310 transitions. [2024-11-10 04:07:44,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 04:07:44,019 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 160 [2024-11-10 04:07:44,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:07:44,021 INFO L225 Difference]: With dead ends: 221 [2024-11-10 04:07:44,021 INFO L226 Difference]: Without dead ends: 151 [2024-11-10 04:07:44,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 312 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-10 04:07:44,026 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 105 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:07:44,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 337 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 04:07:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-10 04:07:44,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2024-11-10 04:07:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 74 states have internal predecessors, (81), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-10 04:07:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 181 transitions. [2024-11-10 04:07:44,059 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 181 transitions. Word has length 160 [2024-11-10 04:07:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:07:44,060 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 181 transitions. [2024-11-10 04:07:44,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 04:07:44,060 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 181 transitions. [2024-11-10 04:07:44,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 04:07:44,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:07:44,063 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:07:44,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 04:07:44,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:07:44,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:07:44,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:07:44,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1212001499, now seen corresponding path program 1 times [2024-11-10 04:07:44,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:07:44,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997543021] [2024-11-10 04:07:44,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:07:44,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:07:44,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:07:44,267 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:07:44,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 04:07:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:07:44,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 04:07:44,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:08:16,352 WARN L286 SmtUtils]: Spent 10.18s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-10 04:08:44,238 WARN L286 SmtUtils]: Spent 11.23s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)