./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.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 be1d1589c624dea5a45504e36955868605b81db28651b11be6c6e5b41a1451c9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:22:55,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:22:55,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 14:22:55,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:22:55,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:22:55,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:22:55,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:22:55,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:22:55,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:22:55,212 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:22:55,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:22:55,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:22:55,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:22:55,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:22:55,214 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:22:55,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:22:55,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:22:55,215 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:22:55,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 14:22:55,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:22:55,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:22:55,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:22:55,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:22:55,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:22:55,220 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:22:55,220 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:22:55,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:22:55,221 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:22:55,221 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:22:55,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:22:55,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:22:55,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:22:55,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:22:55,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:22:55,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:22:55,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:22:55,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 14:22:55,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 14:22:55,223 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:22:55,223 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:22:55,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:22:55,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:22:55,225 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 -> be1d1589c624dea5a45504e36955868605b81db28651b11be6c6e5b41a1451c9 [2024-11-16 14:22:55,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:22:55,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:22:55,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:22:55,503 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:22:55,503 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:22:55,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i [2024-11-16 14:22:56,840 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:22:57,018 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:22:57,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i [2024-11-16 14:22:57,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b1e511e/979d8dc6a45146f49b0afa0c5a2b7687/FLAGb639744d4 [2024-11-16 14:22:57,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b1e511e/979d8dc6a45146f49b0afa0c5a2b7687 [2024-11-16 14:22:57,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:22:57,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:22:57,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:22:57,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:22:57,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:22:57,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:22:57" (1/1) ... [2024-11-16 14:22:57,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6940289e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:57, skipping insertion in model container [2024-11-16 14:22:57,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:22:57" (1/1) ... [2024-11-16 14:22:57,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:22:57,197 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i[919,932] [2024-11-16 14:22:57,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:22:57,297 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:22:57,307 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i[919,932] [2024-11-16 14:22:57,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:22:57,357 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:22:57,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:57 WrapperNode [2024-11-16 14:22:57,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:22:57,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:22:57,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:22:57,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:22:57,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:57" (1/1) ... [2024-11-16 14:22:57,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:57" (1/1) ... [2024-11-16 14:22:57,417 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 235 [2024-11-16 14:22:57,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:22:57,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:22:57,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:22:57,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:22:57,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:57" (1/1) ... [2024-11-16 14:22:57,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:57" (1/1) ... [2024-11-16 14:22:57,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:57" (1/1) ... [2024-11-16 14:22:57,476 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 14:22:57,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:57" (1/1) ... [2024-11-16 14:22:57,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:57" (1/1) ... [2024-11-16 14:22:57,498 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:57" (1/1) ... [2024-11-16 14:22:57,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:57" (1/1) ... [2024-11-16 14:22:57,506 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:57" (1/1) ... [2024-11-16 14:22:57,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:57" (1/1) ... [2024-11-16 14:22:57,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:22:57,528 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:22:57,529 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:22:57,529 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:22:57,530 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:57" (1/1) ... [2024-11-16 14:22:57,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:22:57,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:22:57,564 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 14:22:57,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 14:22:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:22:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:22:57,608 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:22:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 14:22:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:22:57,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:22:57,697 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:22:57,699 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:22:58,036 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L188: havoc property_#t~bitwise23#1;havoc property_#t~short24#1; [2024-11-16 14:22:58,073 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 14:22:58,073 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:22:58,092 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:22:58,092 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:22:58,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:22:58 BoogieIcfgContainer [2024-11-16 14:22:58,092 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:22:58,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:22:58,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:22:58,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:22:58,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:22:57" (1/3) ... [2024-11-16 14:22:58,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dca409e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:22:58, skipping insertion in model container [2024-11-16 14:22:58,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:57" (2/3) ... [2024-11-16 14:22:58,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dca409e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:22:58, skipping insertion in model container [2024-11-16 14:22:58,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:22:58" (3/3) ... [2024-11-16 14:22:58,102 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i [2024-11-16 14:22:58,115 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:22:58,116 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:22:58,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:22:58,166 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;@28b45362, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:22:58,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:22:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 14:22:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-16 14:22:58,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:22:58,183 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:22:58,183 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:22:58,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:22:58,188 INFO L85 PathProgramCache]: Analyzing trace with hash -643720172, now seen corresponding path program 1 times [2024-11-16 14:22:58,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:22:58,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060619567] [2024-11-16 14:22:58,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:22:58,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:22:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:22:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 14:22:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 14:22:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 14:22:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 14:22:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 14:22:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 14:22:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:22:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 14:22:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:22:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 14:22:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 14:22:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 14:22:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 14:22:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 14:22:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 14:22:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 14:22:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:22:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 14:22:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:22:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 14:22:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:22:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:22:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:22:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:22:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:22:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:22:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:22:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:22:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 14:22:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-16 14:22:58,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:22:58,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060619567] [2024-11-16 14:22:58,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060619567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:22:58,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:22:58,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:22:58,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156294350] [2024-11-16 14:22:58,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:22:58,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:22:58,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:22:58,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:22:58,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:22:58,613 INFO L87 Difference]: Start difference. First operand has 105 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-16 14:22:58,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:22:58,655 INFO L93 Difference]: Finished difference Result 202 states and 351 transitions. [2024-11-16 14:22:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:22:58,658 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 199 [2024-11-16 14:22:58,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:22:58,666 INFO L225 Difference]: With dead ends: 202 [2024-11-16 14:22:58,667 INFO L226 Difference]: Without dead ends: 100 [2024-11-16 14:22:58,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:22:58,674 INFO L432 NwaCegarLoop]: 153 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, 153 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-16 14:22:58,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:22:58,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-16 14:22:58,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-16 14:22:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 14:22:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 156 transitions. [2024-11-16 14:22:58,724 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 156 transitions. Word has length 199 [2024-11-16 14:22:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:22:58,725 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 156 transitions. [2024-11-16 14:22:58,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-16 14:22:58,725 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 156 transitions. [2024-11-16 14:22:58,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-16 14:22:58,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:22:58,729 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:22:58,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 14:22:58,730 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:22:58,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:22:58,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1120050764, now seen corresponding path program 1 times [2024-11-16 14:22:58,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:22:58,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196723518] [2024-11-16 14:22:58,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:22:58,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:22:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:22:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 14:22:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 14:22:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 14:22:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 14:22:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 14:22:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 14:22:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:22:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 14:22:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:22:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 14:22:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 14:22:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 14:22:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 14:22:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 14:22:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 14:22:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 14:22:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:22:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 14:22:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:22:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 14:22:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:22:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:22:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:22:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:22:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:22:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:22:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:22:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:22:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 14:22:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-16 14:22:59,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:22:59,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196723518] [2024-11-16 14:22:59,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196723518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:22:59,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:22:59,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:22:59,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407532457] [2024-11-16 14:22:59,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:22:59,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:22:59,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:22:59,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:22:59,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:22:59,135 INFO L87 Difference]: Start difference. First operand 100 states and 156 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-16 14:22:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:22:59,174 INFO L93 Difference]: Finished difference Result 198 states and 311 transitions. [2024-11-16 14:22:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:22:59,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 199 [2024-11-16 14:22:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:22:59,179 INFO L225 Difference]: With dead ends: 198 [2024-11-16 14:22:59,180 INFO L226 Difference]: Without dead ends: 101 [2024-11-16 14:22:59,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:22:59,182 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:22:59,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:22:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-16 14:22:59,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-16 14:22:59,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 69 states have internal predecessors, (97), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 14:22:59,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 157 transitions. [2024-11-16 14:22:59,196 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 157 transitions. Word has length 199 [2024-11-16 14:22:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:22:59,198 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 157 transitions. [2024-11-16 14:22:59,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-16 14:22:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 157 transitions. [2024-11-16 14:22:59,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-16 14:22:59,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:22:59,202 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:22:59,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 14:22:59,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:22:59,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:22:59,204 INFO L85 PathProgramCache]: Analyzing trace with hash 622759571, now seen corresponding path program 1 times [2024-11-16 14:22:59,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:22:59,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659245806] [2024-11-16 14:22:59,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:22:59,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:22:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:23:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 14:23:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 14:23:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 14:23:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 14:23:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 14:23:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 14:23:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:23:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 14:23:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:23:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 14:23:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 14:23:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 14:23:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 14:23:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 14:23:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 14:23:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 14:23:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:23:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 14:23:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:23:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 14:23:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:23:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:23:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:23:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:23:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:23:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:23:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:23:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:23:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 14:23:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-16 14:23:00,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:23:00,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659245806] [2024-11-16 14:23:00,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659245806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:23:00,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:23:00,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 14:23:00,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285619410] [2024-11-16 14:23:00,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:23:00,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 14:23:00,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:23:00,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 14:23:00,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 14:23:00,276 INFO L87 Difference]: Start difference. First operand 101 states and 157 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-16 14:23:01,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:23:01,240 INFO L93 Difference]: Finished difference Result 553 states and 835 transitions. [2024-11-16 14:23:01,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 14:23:01,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 199 [2024-11-16 14:23:01,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:23:01,244 INFO L225 Difference]: With dead ends: 553 [2024-11-16 14:23:01,244 INFO L226 Difference]: Without dead ends: 455 [2024-11-16 14:23:01,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-11-16 14:23:01,246 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 672 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 14:23:01,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 791 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 14:23:01,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-16 14:23:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 410. [2024-11-16 14:23:01,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 287 states have (on average 1.3937282229965158) internal successors, (400), 290 states have internal predecessors, (400), 116 states have call successors, (116), 6 states have call predecessors, (116), 6 states have return successors, (116), 113 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-16 14:23:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 632 transitions. [2024-11-16 14:23:01,305 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 632 transitions. Word has length 199 [2024-11-16 14:23:01,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:23:01,306 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 632 transitions. [2024-11-16 14:23:01,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-16 14:23:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 632 transitions. [2024-11-16 14:23:01,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-16 14:23:01,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:01,308 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:01,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 14:23:01,308 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:01,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:01,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1174191788, now seen corresponding path program 1 times [2024-11-16 14:23:01,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:23:01,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114433585] [2024-11-16 14:23:01,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:01,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:23:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:23:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 14:23:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 14:23:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 14:23:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 14:23:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 14:23:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 14:23:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:23:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 14:23:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:23:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 14:23:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 14:23:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 14:23:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 14:23:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 14:23:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 14:23:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 14:23:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:23:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 14:23:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:23:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 14:23:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:23:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:23:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:23:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:23:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:23:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:23:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:23:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:23:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 14:23:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 30 proven. 57 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-16 14:23:02,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:23:02,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114433585] [2024-11-16 14:23:02,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114433585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:23:02,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742399100] [2024-11-16 14:23:02,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:02,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:23:02,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:23:02,735 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:23:02,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 14:23:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 14:23:02,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:23:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 809 proven. 57 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2024-11-16 14:23:03,811 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:23:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 30 proven. 57 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-16 14:23:04,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742399100] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:23:04,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:23:04,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 11] total 30 [2024-11-16 14:23:04,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526831437] [2024-11-16 14:23:04,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:23:04,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-16 14:23:04,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:23:04,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-16 14:23:04,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2024-11-16 14:23:04,491 INFO L87 Difference]: Start difference. First operand 410 states and 632 transitions. Second operand has 30 states, 30 states have (on average 4.633333333333334) internal successors, (139), 30 states have internal predecessors, (139), 7 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 7 states have call predecessors, (90), 7 states have call successors, (90) [2024-11-16 14:23:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:23:14,321 INFO L93 Difference]: Finished difference Result 2486 states and 3558 transitions. [2024-11-16 14:23:14,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2024-11-16 14:23:14,322 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.633333333333334) internal successors, (139), 30 states have internal predecessors, (139), 7 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 7 states have call predecessors, (90), 7 states have call successors, (90) Word has length 199 [2024-11-16 14:23:14,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:23:14,340 INFO L225 Difference]: With dead ends: 2486 [2024-11-16 14:23:14,340 INFO L226 Difference]: Without dead ends: 2079 [2024-11-16 14:23:14,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10237 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5019, Invalid=22703, Unknown=0, NotChecked=0, Total=27722 [2024-11-16 14:23:14,349 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 3290 mSDsluCounter, 3006 mSDsCounter, 0 mSdLazyCounter, 4848 mSolverCounterSat, 1177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3319 SdHoareTripleChecker+Valid, 3325 SdHoareTripleChecker+Invalid, 6025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1177 IncrementalHoareTripleChecker+Valid, 4848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:23:14,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3319 Valid, 3325 Invalid, 6025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1177 Valid, 4848 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-16 14:23:14,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2024-11-16 14:23:14,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 722. [2024-11-16 14:23:14,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 552 states have (on average 1.434782608695652) internal successors, (792), 560 states have internal predecessors, (792), 154 states have call successors, (154), 15 states have call predecessors, (154), 15 states have return successors, (154), 146 states have call predecessors, (154), 154 states have call successors, (154) [2024-11-16 14:23:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1100 transitions. [2024-11-16 14:23:14,511 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1100 transitions. Word has length 199 [2024-11-16 14:23:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:23:14,512 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1100 transitions. [2024-11-16 14:23:14,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.633333333333334) internal successors, (139), 30 states have internal predecessors, (139), 7 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 7 states have call predecessors, (90), 7 states have call successors, (90) [2024-11-16 14:23:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1100 transitions. [2024-11-16 14:23:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-16 14:23:14,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:14,515 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:14,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 14:23:14,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:23:14,718 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:14,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:14,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1082719219, now seen corresponding path program 1 times [2024-11-16 14:23:14,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:23:14,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869710730] [2024-11-16 14:23:14,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:14,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:23:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:23:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 14:23:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 14:23:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 14:23:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 14:23:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 14:23:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 14:23:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:23:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 14:23:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:23:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 14:23:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 14:23:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 14:23:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 14:23:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 14:23:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 14:23:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 14:23:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:23:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 14:23:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:23:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 14:23:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:23:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:23:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:23:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:23:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:23:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:23:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:23:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:23:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 14:23:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 30 proven. 57 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-16 14:23:15,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:23:15,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869710730] [2024-11-16 14:23:15,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869710730] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:23:15,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244568489] [2024-11-16 14:23:15,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:15,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:23:15,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:23:15,326 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:23:15,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 14:23:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:15,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 14:23:15,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:23:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 830 proven. 108 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2024-11-16 14:23:16,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:23:16,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244568489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:23:16,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 14:23:16,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2024-11-16 14:23:16,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449549223] [2024-11-16 14:23:16,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 14:23:16,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-16 14:23:16,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:23:16,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-16 14:23:16,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2024-11-16 14:23:16,843 INFO L87 Difference]: Start difference. First operand 722 states and 1100 transitions. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 3 states have call successors, (60), 4 states have call predecessors, (60), 6 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) [2024-11-16 14:23:19,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:23:19,479 INFO L93 Difference]: Finished difference Result 2013 states and 2961 transitions. [2024-11-16 14:23:19,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2024-11-16 14:23:19,480 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 3 states have call successors, (60), 4 states have call predecessors, (60), 6 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) Word has length 199 [2024-11-16 14:23:19,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:23:19,485 INFO L225 Difference]: With dead ends: 2013 [2024-11-16 14:23:19,486 INFO L226 Difference]: Without dead ends: 1294 [2024-11-16 14:23:19,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2707 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1672, Invalid=6338, Unknown=0, NotChecked=0, Total=8010 [2024-11-16 14:23:19,493 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 1373 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 2126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 14:23:19,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 1310 Invalid, 2126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 14:23:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2024-11-16 14:23:19,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 719. [2024-11-16 14:23:19,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 547 states have (on average 1.4241316270566728) internal successors, (779), 555 states have internal predecessors, (779), 154 states have call successors, (154), 17 states have call predecessors, (154), 17 states have return successors, (154), 146 states have call predecessors, (154), 154 states have call successors, (154) [2024-11-16 14:23:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1087 transitions. [2024-11-16 14:23:19,570 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1087 transitions. Word has length 199 [2024-11-16 14:23:19,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:23:19,571 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 1087 transitions. [2024-11-16 14:23:19,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 3 states have call successors, (60), 4 states have call predecessors, (60), 6 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) [2024-11-16 14:23:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1087 transitions. [2024-11-16 14:23:19,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-16 14:23:19,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:19,573 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:19,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 14:23:19,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:23:19,779 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:19,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:19,780 INFO L85 PathProgramCache]: Analyzing trace with hash -274831842, now seen corresponding path program 1 times [2024-11-16 14:23:19,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:23:19,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029357885] [2024-11-16 14:23:19,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:19,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:23:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:23:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 14:23:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 14:23:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 14:23:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 14:23:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 14:23:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 14:23:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:23:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 14:23:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:23:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 14:23:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 14:23:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 14:23:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 14:23:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 14:23:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 14:23:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 14:23:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:23:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 14:23:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:23:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 14:23:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:23:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:23:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:23:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:23:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:23:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:23:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:23:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:23:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 14:23:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 48 proven. 120 refuted. 0 times theorem prover too weak. 1572 trivial. 0 not checked. [2024-11-16 14:23:20,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:23:20,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029357885] [2024-11-16 14:23:20,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029357885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:23:20,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764591922] [2024-11-16 14:23:20,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:20,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:23:20,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:23:20,493 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:23:20,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 14:23:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:20,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-16 14:23:20,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:23:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 809 proven. 222 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2024-11-16 14:23:21,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:23:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 75 proven. 177 refuted. 0 times theorem prover too weak. 1488 trivial. 0 not checked. [2024-11-16 14:23:23,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764591922] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:23:23,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:23:23,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 16] total 37 [2024-11-16 14:23:23,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375695992] [2024-11-16 14:23:23,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:23:23,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-16 14:23:23,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:23:23,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-16 14:23:23,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2024-11-16 14:23:23,267 INFO L87 Difference]: Start difference. First operand 719 states and 1087 transitions. Second operand has 37 states, 35 states have (on average 4.485714285714286) internal successors, (157), 35 states have internal predecessors, (157), 11 states have call successors, (90), 5 states have call predecessors, (90), 11 states have return successors, (90), 11 states have call predecessors, (90), 11 states have call successors, (90) [2024-11-16 14:23:29,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:23:29,580 INFO L93 Difference]: Finished difference Result 2576 states and 3712 transitions. [2024-11-16 14:23:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-11-16 14:23:29,581 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 4.485714285714286) internal successors, (157), 35 states have internal predecessors, (157), 11 states have call successors, (90), 5 states have call predecessors, (90), 11 states have return successors, (90), 11 states have call predecessors, (90), 11 states have call successors, (90) Word has length 200 [2024-11-16 14:23:29,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:23:29,590 INFO L225 Difference]: With dead ends: 2576 [2024-11-16 14:23:29,591 INFO L226 Difference]: Without dead ends: 1860 [2024-11-16 14:23:29,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 462 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7000 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4696, Invalid=15044, Unknown=0, NotChecked=0, Total=19740 [2024-11-16 14:23:29,598 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 2644 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 3223 mSolverCounterSat, 1012 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2649 SdHoareTripleChecker+Valid, 2003 SdHoareTripleChecker+Invalid, 4235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1012 IncrementalHoareTripleChecker+Valid, 3223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-16 14:23:29,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2649 Valid, 2003 Invalid, 4235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1012 Valid, 3223 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-16 14:23:29,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2024-11-16 14:23:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 512. [2024-11-16 14:23:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 389 states have (on average 1.4447300771208227) internal successors, (562), 392 states have internal predecessors, (562), 108 states have call successors, (108), 14 states have call predecessors, (108), 14 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-16 14:23:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 778 transitions. [2024-11-16 14:23:29,672 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 778 transitions. Word has length 200 [2024-11-16 14:23:29,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:23:29,674 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 778 transitions. [2024-11-16 14:23:29,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 4.485714285714286) internal successors, (157), 35 states have internal predecessors, (157), 11 states have call successors, (90), 5 states have call predecessors, (90), 11 states have return successors, (90), 11 states have call predecessors, (90), 11 states have call successors, (90) [2024-11-16 14:23:29,674 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 778 transitions. [2024-11-16 14:23:29,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-16 14:23:29,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:29,679 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:29,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 14:23:29,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:23:29,880 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:29,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:29,881 INFO L85 PathProgramCache]: Analyzing trace with hash 419008585, now seen corresponding path program 1 times [2024-11-16 14:23:29,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:23:29,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674149968] [2024-11-16 14:23:29,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:29,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:23:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:23:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 14:23:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 14:23:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 14:23:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 14:23:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 14:23:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 14:23:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:23:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 14:23:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:23:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 14:23:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 14:23:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 14:23:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 14:23:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 14:23:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 14:23:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 14:23:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:23:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 14:23:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:23:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 14:23:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:23:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:23:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:23:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:23:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:23:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:23:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:23:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:23:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 14:23:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-16 14:23:29,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:23:29,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674149968] [2024-11-16 14:23:29,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674149968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:23:29,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:23:29,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:23:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687722058] [2024-11-16 14:23:29,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:23:29,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:23:29,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:23:29,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:23:29,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:23:29,987 INFO L87 Difference]: Start difference. First operand 512 states and 778 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-16 14:23:30,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:23:30,061 INFO L93 Difference]: Finished difference Result 644 states and 979 transitions. [2024-11-16 14:23:30,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:23:30,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 200 [2024-11-16 14:23:30,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:23:30,064 INFO L225 Difference]: With dead ends: 644 [2024-11-16 14:23:30,064 INFO L226 Difference]: Without dead ends: 516 [2024-11-16 14:23:30,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:23:30,067 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:23:30,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:23:30,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-16 14:23:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 515. [2024-11-16 14:23:30,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 392 states have (on average 1.441326530612245) internal successors, (565), 395 states have internal predecessors, (565), 108 states have call successors, (108), 14 states have call predecessors, (108), 14 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-16 14:23:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 781 transitions. [2024-11-16 14:23:30,136 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 781 transitions. Word has length 200 [2024-11-16 14:23:30,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:23:30,137 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 781 transitions. [2024-11-16 14:23:30,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-16 14:23:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 781 transitions. [2024-11-16 14:23:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-16 14:23:30,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:30,145 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:30,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 14:23:30,145 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:30,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:30,145 INFO L85 PathProgramCache]: Analyzing trace with hash -2133148376, now seen corresponding path program 1 times [2024-11-16 14:23:30,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:23:30,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864033771] [2024-11-16 14:23:30,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:30,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:23:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:23:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 14:23:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 14:23:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 14:23:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 14:23:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 14:23:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 14:23:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:23:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 14:23:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:23:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 14:23:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 14:23:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 14:23:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 14:23:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 14:23:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 14:23:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 14:23:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:23:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 14:23:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:23:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 14:23:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:23:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:23:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:23:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:23:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:23:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:23:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:23:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:23:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 14:23:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 30 proven. 57 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-16 14:23:30,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:23:30,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864033771] [2024-11-16 14:23:30,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864033771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:23:30,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067710110] [2024-11-16 14:23:30,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:30,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:23:30,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:23:30,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:23:30,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 14:23:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:30,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-16 14:23:30,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:23:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 932 proven. 108 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2024-11-16 14:23:31,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:23:34,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067710110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:23:34,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 14:23:34,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2024-11-16 14:23:34,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884142265] [2024-11-16 14:23:34,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 14:23:34,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-16 14:23:34,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:23:34,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-16 14:23:34,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2024-11-16 14:23:34,368 INFO L87 Difference]: Start difference. First operand 515 states and 781 transitions. Second operand has 21 states, 21 states have (on average 4.904761904761905) internal successors, (103), 20 states have internal predecessors, (103), 6 states have call successors, (60), 5 states have call predecessors, (60), 7 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) [2024-11-16 14:23:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:23:36,793 INFO L93 Difference]: Finished difference Result 1533 states and 2233 transitions. [2024-11-16 14:23:36,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-16 14:23:36,794 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.904761904761905) internal successors, (103), 20 states have internal predecessors, (103), 6 states have call successors, (60), 5 states have call predecessors, (60), 7 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) Word has length 200 [2024-11-16 14:23:36,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:23:36,798 INFO L225 Difference]: With dead ends: 1533 [2024-11-16 14:23:36,798 INFO L226 Difference]: Without dead ends: 1021 [2024-11-16 14:23:36,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1503, Invalid=4503, Unknown=0, NotChecked=0, Total=6006 [2024-11-16 14:23:36,800 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 651 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 2315 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 2315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 14:23:36,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1754 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2315 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 14:23:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2024-11-16 14:23:36,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 713. [2024-11-16 14:23:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 548 states have (on average 1.4343065693430657) internal successors, (786), 552 states have internal predecessors, (786), 144 states have call successors, (144), 20 states have call predecessors, (144), 20 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144) [2024-11-16 14:23:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1074 transitions. [2024-11-16 14:23:36,881 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1074 transitions. Word has length 200 [2024-11-16 14:23:36,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:23:36,881 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 1074 transitions. [2024-11-16 14:23:36,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.904761904761905) internal successors, (103), 20 states have internal predecessors, (103), 6 states have call successors, (60), 5 states have call predecessors, (60), 7 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) [2024-11-16 14:23:36,881 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1074 transitions. [2024-11-16 14:23:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-16 14:23:36,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:36,883 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:36,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 14:23:37,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:23:37,083 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:37,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:37,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1921797463, now seen corresponding path program 1 times [2024-11-16 14:23:37,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:23:37,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288995644] [2024-11-16 14:23:37,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:37,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:23:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:23:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 14:23:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 14:23:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 14:23:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 14:23:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 14:23:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 14:23:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:23:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 14:23:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:23:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 14:23:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 14:23:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 14:23:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 14:23:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 14:23:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 14:23:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 14:23:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:23:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 14:23:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:23:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 14:23:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:23:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:23:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:23:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:23:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:23:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:23:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:23:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:23:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 14:23:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-16 14:23:37,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:23:37,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288995644] [2024-11-16 14:23:37,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288995644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:23:37,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:23:37,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:23:37,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2542471] [2024-11-16 14:23:37,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:23:37,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:23:37,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:23:37,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:23:37,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:23:37,187 INFO L87 Difference]: Start difference. First operand 713 states and 1074 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-16 14:23:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:23:37,327 INFO L93 Difference]: Finished difference Result 1704 states and 2525 transitions. [2024-11-16 14:23:37,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:23:37,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 200 [2024-11-16 14:23:37,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:23:37,332 INFO L225 Difference]: With dead ends: 1704 [2024-11-16 14:23:37,332 INFO L226 Difference]: Without dead ends: 994 [2024-11-16 14:23:37,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:23:37,334 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 84 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:23:37,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 284 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:23:37,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2024-11-16 14:23:37,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 765. [2024-11-16 14:23:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 591 states have (on average 1.4077834179357023) internal successors, (832), 596 states have internal predecessors, (832), 152 states have call successors, (152), 21 states have call predecessors, (152), 21 states have return successors, (152), 147 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-16 14:23:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1136 transitions. [2024-11-16 14:23:37,429 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1136 transitions. Word has length 200 [2024-11-16 14:23:37,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:23:37,429 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1136 transitions. [2024-11-16 14:23:37,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-16 14:23:37,430 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1136 transitions. [2024-11-16 14:23:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-16 14:23:37,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:37,431 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:37,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 14:23:37,431 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:37,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:37,432 INFO L85 PathProgramCache]: Analyzing trace with hash -677032982, now seen corresponding path program 1 times [2024-11-16 14:23:37,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:23:37,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832503410] [2024-11-16 14:23:37,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:37,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:23:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:23:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 14:23:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 14:23:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 14:23:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 14:23:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 14:23:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 14:23:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:23:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 14:23:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:23:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 14:23:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 14:23:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 14:23:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 14:23:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 14:23:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 14:23:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 14:23:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:23:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 14:23:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:23:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 14:23:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:23:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:23:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:23:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:23:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:23:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:23:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:23:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:23:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 14:23:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-16 14:23:37,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:23:37,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832503410] [2024-11-16 14:23:37,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832503410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:23:37,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:23:37,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:23:37,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353556511] [2024-11-16 14:23:37,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:23:37,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:23:37,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:23:37,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:23:37,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:23:37,512 INFO L87 Difference]: Start difference. First operand 765 states and 1136 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-16 14:23:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:23:37,663 INFO L93 Difference]: Finished difference Result 1627 states and 2374 transitions. [2024-11-16 14:23:37,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:23:37,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 200 [2024-11-16 14:23:37,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:23:37,667 INFO L225 Difference]: With dead ends: 1627 [2024-11-16 14:23:37,667 INFO L226 Difference]: Without dead ends: 865 [2024-11-16 14:23:37,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:23:37,670 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 70 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:23:37,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 357 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:23:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-16 14:23:37,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 558. [2024-11-16 14:23:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 410 states have (on average 1.3414634146341464) internal successors, (550), 411 states have internal predecessors, (550), 126 states have call successors, (126), 21 states have call predecessors, (126), 21 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-16 14:23:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 802 transitions. [2024-11-16 14:23:37,751 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 802 transitions. Word has length 200 [2024-11-16 14:23:37,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:23:37,753 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 802 transitions. [2024-11-16 14:23:37,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-16 14:23:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 802 transitions. [2024-11-16 14:23:37,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-16 14:23:37,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:37,754 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:37,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 14:23:37,754 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:37,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:37,755 INFO L85 PathProgramCache]: Analyzing trace with hash 106288893, now seen corresponding path program 1 times [2024-11-16 14:23:37,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:23:37,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912518130] [2024-11-16 14:23:37,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:37,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:23:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:23:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 14:23:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 14:23:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 14:23:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 14:23:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 14:23:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 14:23:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:23:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 14:23:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:23:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 14:23:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 14:23:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 14:23:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 14:23:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 14:23:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 14:23:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 14:23:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:23:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 14:23:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:23:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 14:23:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:23:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:23:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:23:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:23:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:23:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:23:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:23:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:23:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 14:23:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 48 proven. 120 refuted. 0 times theorem prover too weak. 1572 trivial. 0 not checked. [2024-11-16 14:23:38,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:23:38,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912518130] [2024-11-16 14:23:38,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912518130] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:23:38,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188599698] [2024-11-16 14:23:38,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:38,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:23:38,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:23:38,453 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:23:38,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 14:23:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:38,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-16 14:23:38,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:23:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 828 proven. 228 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-16 14:23:39,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:23:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 84 proven. 246 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-11-16 14:23:42,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188599698] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:23:42,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:23:42,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 17] total 40 [2024-11-16 14:23:42,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089542979] [2024-11-16 14:23:42,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:23:42,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-16 14:23:42,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:23:42,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-16 14:23:42,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1231, Unknown=0, NotChecked=0, Total=1560 [2024-11-16 14:23:42,556 INFO L87 Difference]: Start difference. First operand 558 states and 802 transitions. Second operand has 40 states, 37 states have (on average 4.486486486486487) internal successors, (166), 36 states have internal predecessors, (166), 13 states have call successors, (90), 6 states have call predecessors, (90), 13 states have return successors, (90), 13 states have call predecessors, (90), 13 states have call successors, (90) [2024-11-16 14:23:51,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:23:51,188 INFO L93 Difference]: Finished difference Result 1823 states and 2508 transitions. [2024-11-16 14:23:51,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2024-11-16 14:23:51,189 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 4.486486486486487) internal successors, (166), 36 states have internal predecessors, (166), 13 states have call successors, (90), 6 states have call predecessors, (90), 13 states have return successors, (90), 13 states have call predecessors, (90), 13 states have call successors, (90) Word has length 201 [2024-11-16 14:23:51,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:23:51,193 INFO L225 Difference]: With dead ends: 1823 [2024-11-16 14:23:51,193 INFO L226 Difference]: Without dead ends: 1268 [2024-11-16 14:23:51,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8220 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5294, Invalid=17356, Unknown=0, NotChecked=0, Total=22650 [2024-11-16 14:23:51,197 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 2149 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 2504 mSolverCounterSat, 912 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2150 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 3416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 912 IncrementalHoareTripleChecker+Valid, 2504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:23:51,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2150 Valid, 1500 Invalid, 3416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [912 Valid, 2504 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-16 14:23:51,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2024-11-16 14:23:51,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 573. [2024-11-16 14:23:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 426 states have (on average 1.352112676056338) internal successors, (576), 426 states have internal predecessors, (576), 120 states have call successors, (120), 26 states have call predecessors, (120), 26 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-16 14:23:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 816 transitions. [2024-11-16 14:23:51,302 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 816 transitions. Word has length 201 [2024-11-16 14:23:51,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:23:51,302 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 816 transitions. [2024-11-16 14:23:51,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 4.486486486486487) internal successors, (166), 36 states have internal predecessors, (166), 13 states have call successors, (90), 6 states have call predecessors, (90), 13 states have return successors, (90), 13 states have call predecessors, (90), 13 states have call successors, (90) [2024-11-16 14:23:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 816 transitions. [2024-11-16 14:23:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-16 14:23:51,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:51,304 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:51,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-16 14:23:51,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-16 14:23:51,508 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:51,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:51,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1493683259, now seen corresponding path program 1 times [2024-11-16 14:23:51,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:23:51,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561856928] [2024-11-16 14:23:51,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:51,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:23:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:23:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 14:23:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 14:23:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 14:23:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 14:23:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 14:23:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 14:23:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:23:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 14:23:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:23:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 14:23:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 14:23:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 14:23:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 14:23:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 14:23:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 14:23:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 14:23:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:23:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 14:23:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:23:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 14:23:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:23:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:23:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:23:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 14:23:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:23:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:23:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:23:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:23:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 14:23:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-16 14:23:51,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:23:51,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561856928] [2024-11-16 14:23:51,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561856928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:23:51,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:23:51,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:23:51,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701102050] [2024-11-16 14:23:51,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:23:51,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:23:51,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:23:51,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:23:51,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:23:51,612 INFO L87 Difference]: Start difference. First operand 573 states and 816 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-16 14:23:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:23:51,709 INFO L93 Difference]: Finished difference Result 576 states and 818 transitions. [2024-11-16 14:23:51,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:23:51,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 201 [2024-11-16 14:23:51,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:23:51,712 INFO L225 Difference]: With dead ends: 576 [2024-11-16 14:23:51,712 INFO L226 Difference]: Without dead ends: 424 [2024-11-16 14:23:51,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:23:51,713 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:23:51,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:23:51,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-16 14:23:51,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2024-11-16 14:23:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 312 states have (on average 1.3365384615384615) internal successors, (417), 312 states have internal predecessors, (417), 90 states have call successors, (90), 21 states have call predecessors, (90), 21 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-16 14:23:51,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 597 transitions. [2024-11-16 14:23:51,816 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 597 transitions. Word has length 201 [2024-11-16 14:23:51,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:23:51,816 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 597 transitions. [2024-11-16 14:23:51,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-16 14:23:51,816 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 597 transitions. [2024-11-16 14:23:51,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-16 14:23:51,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:51,817 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:51,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 14:23:51,818 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:51,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:51,818 INFO L85 PathProgramCache]: Analyzing trace with hash 249127076, now seen corresponding path program 1 times [2024-11-16 14:23:51,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:23:51,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798983341] [2024-11-16 14:23:51,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:51,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:23:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 14:23:51,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1709366462] [2024-11-16 14:23:51,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:51,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:23:51,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:23:51,875 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:23:51,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-16 14:23:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 14:23:52,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 14:23:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 14:23:52,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 14:23:52,168 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 14:23:52,170 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 14:23:52,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-16 14:23:52,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:23:52,375 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:52,496 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 14:23:52,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 02:23:52 BoogieIcfgContainer [2024-11-16 14:23:52,500 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 14:23:52,501 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 14:23:52,501 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 14:23:52,501 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 14:23:52,501 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:22:58" (3/4) ... [2024-11-16 14:23:52,503 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 14:23:52,504 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 14:23:52,504 INFO L158 Benchmark]: Toolchain (without parser) took 55459.57ms. Allocated memory was 205.5MB in the beginning and 786.4MB in the end (delta: 580.9MB). Free memory was 134.2MB in the beginning and 614.2MB in the end (delta: -480.0MB). Peak memory consumption was 103.3MB. Max. memory is 16.1GB. [2024-11-16 14:23:52,504 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 205.5MB. Free memory is still 162.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:23:52,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.19ms. Allocated memory is still 205.5MB. Free memory was 134.0MB in the beginning and 116.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 14:23:52,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.51ms. Allocated memory is still 205.5MB. Free memory was 116.7MB in the beginning and 111.6MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 14:23:52,505 INFO L158 Benchmark]: Boogie Preprocessor took 108.73ms. Allocated memory is still 205.5MB. Free memory was 111.6MB in the beginning and 171.0MB in the end (delta: -59.4MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-11-16 14:23:52,506 INFO L158 Benchmark]: IcfgBuilder took 564.41ms. Allocated memory is still 205.5MB. Free memory was 171.0MB in the beginning and 136.4MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-16 14:23:52,506 INFO L158 Benchmark]: TraceAbstraction took 54406.24ms. Allocated memory was 205.5MB in the beginning and 786.4MB in the end (delta: 580.9MB). Free memory was 136.4MB in the beginning and 614.2MB in the end (delta: -477.8MB). Peak memory consumption was 105.2MB. Max. memory is 16.1GB. [2024-11-16 14:23:52,506 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 786.4MB. Free memory is still 614.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:23:52,507 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.17ms. Allocated memory is still 205.5MB. Free memory is still 162.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.19ms. Allocated memory is still 205.5MB. Free memory was 134.0MB in the beginning and 116.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.51ms. Allocated memory is still 205.5MB. Free memory was 116.7MB in the beginning and 111.6MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.73ms. Allocated memory is still 205.5MB. Free memory was 111.6MB in the beginning and 171.0MB in the end (delta: -59.4MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * IcfgBuilder took 564.41ms. Allocated memory is still 205.5MB. Free memory was 171.0MB in the beginning and 136.4MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 54406.24ms. Allocated memory was 205.5MB in the beginning and 786.4MB in the end (delta: 580.9MB). Free memory was 136.4MB in the beginning and 614.2MB in the end (delta: -477.8MB). Peak memory consumption was 105.2MB. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 786.4MB. Free memory is still 614.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of bitwiseAnd at line 129. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 1000.6; [L23] float var_1_2 = 255.675; [L24] float var_1_3 = 10.4; [L25] float var_1_4 = 31.4; [L26] double var_1_5 = 7.75; [L27] double var_1_6 = 63.1; [L28] signed char var_1_7 = 32; [L29] signed char var_1_10 = 64; [L30] signed short int var_1_11 = 5; [L31] unsigned short int var_1_12 = 4; [L32] unsigned char var_1_13 = 1; [L33] unsigned short int var_1_14 = 49632; [L34] unsigned short int var_1_15 = 0; [L35] signed char var_1_16 = 50; [L36] signed char var_1_18 = 2; [L37] signed char var_1_19 = 25; [L38] signed char var_1_20 = 10; [L39] signed char var_1_21 = 1; [L40] signed char var_1_22 = 8; [L41] unsigned long int var_1_23 = 25; [L42] unsigned short int var_1_24 = 32; [L43] signed long int var_1_26 = 50; [L44] unsigned long int var_1_27 = 8; [L45] float var_1_29 = 4.5; [L46] signed long int var_1_31 = -32; [L47] float var_1_32 = 5.75; [L48] unsigned short int var_1_37 = 2; [L49] unsigned long int var_1_39 = 5; [L50] unsigned long int var_1_43 = 2711454658; [L51] unsigned long int var_1_44 = 3606433920; [L52] signed char var_1_45 = 2; [L53] unsigned long int var_1_48 = 1; [L54] double var_1_49 = 1000000.8; [L55] signed char last_1_var_1_7 = 32; [L56] signed short int last_1_var_1_11 = 5; [L57] signed long int last_1_var_1_26 = 50; VAL [isInitial=0, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_2=10227/40, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_3=52/5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L183] last_1_var_1_7 = var_1_7 [L184] last_1_var_1_11 = var_1_11 [L185] last_1_var_1_26 = var_1_26 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_2=10227/40, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_3=52/5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L134] var_1_2 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_3=52/5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_3=52/5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L135] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_3=52/5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L136] var_1_3 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L137] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L138] var_1_4 = __VERIFIER_nondet_float() [L139] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L139] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L140] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L140] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L141] var_1_5 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_6=631/10, var_1_7=32] [L142] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_6=631/10, var_1_7=32] [L143] var_1_6 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L144] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L145] var_1_10 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L146] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L147] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L147] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L148] var_1_13 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L149] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L150] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L150] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L151] var_1_14 = __VERIFIER_nondet_ushort() [L152] CALL assume_abort_if_not(var_1_14 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L152] RET assume_abort_if_not(var_1_14 >= 32767) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L153] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L153] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L154] var_1_15 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L155] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L156] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L156] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L157] var_1_18 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L158] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L159] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L159] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L160] var_1_19 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L161] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L162] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L162] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L163] var_1_20 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_20 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L164] RET assume_abort_if_not(var_1_20 >= -63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L165] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L165] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L166] var_1_21 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_21 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L167] RET assume_abort_if_not(var_1_21 >= -1) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L168] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L168] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L169] var_1_22 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L170] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L171] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L171] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=32, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L172] var_1_24 = __VERIFIER_nondet_ushort() [L173] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L173] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L174] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L174] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2711454658, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L175] var_1_43 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_43 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L176] RET assume_abort_if_not(var_1_43 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L177] CALL assume_abort_if_not(var_1_43 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L177] RET assume_abort_if_not(var_1_43 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=3606433920, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L178] var_1_44 = __VERIFIER_nondet_ulong() [L179] CALL assume_abort_if_not(var_1_44 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L179] RET assume_abort_if_not(var_1_44 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L180] CALL assume_abort_if_not(var_1_44 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L180] RET assume_abort_if_not(var_1_44 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_7=32] [L196] RET updateVariables() [L197] CALL step() [L61] COND FALSE !((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) [L64] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=8, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L66] var_1_27 = var_1_12 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=9/2, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L67] COND TRUE var_1_15 != (var_1_22 + var_1_22) [L68] var_1_29 = 63.875f VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L70] COND TRUE var_1_1 > var_1_4 [L71] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=1, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=-32, var_1_32=23/4, var_1_37=2, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L75] COND TRUE var_1_13 && (var_1_15 >= var_1_24) [L76] var_1_37 = ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=1, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=-32, var_1_32=23/4, var_1_37=0, var_1_39=5, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L78] COND FALSE !((- var_1_6) < var_1_5) [L85] var_1_39 = (var_1_14 + var_1_12) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=1, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=-32, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L87] COND TRUE \read(var_1_13) [L88] var_1_12 = (var_1_14 - var_1_15) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=-32, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L90] var_1_31 = 64 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=2, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L91] COND FALSE !(var_1_15 > (~ (var_1_12 % var_1_43))) [L96] var_1_45 = var_1_22 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L98] signed char stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=50, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L99] COND TRUE var_1_1 <= (((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))) + var_1_1) [L100] var_1_16 = ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L108] EXPR var_1_15 | ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=1, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L108] COND FALSE !((var_1_15 | ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) > var_1_12) [L113] var_1_48 = var_1_14 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=65534, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L114] COND FALSE !(! var_1_13) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=25, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=65534, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L119] COND TRUE (- (var_1_14 - var_1_24)) < var_1_10 [L120] var_1_23 = (var_1_24 + (var_1_22 + 4u)) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=5, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=65534, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L124] COND FALSE !(var_1_6 != 49.125) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=5, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=65534, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L129] EXPR var_1_12 & last_1_var_1_7 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=5, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=65534, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L129] COND FALSE !(-4 > (var_1_12 & last_1_var_1_7)) [L197] RET step() [L198] CALL, EXPR property() [L188] EXPR (((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_12 & last_1_var_1_7)) ? (var_1_7 == ((signed char) var_1_10)) : 1) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=5, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=65534, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L188-L189] return ((((((((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_12 & last_1_var_1_7)) ? (var_1_7 == ((signed char) var_1_10)) : 1)) && ((var_1_1 > var_1_4) ? (var_1_11 == ((signed short int) var_1_10)) : (var_1_11 == ((signed short int) ((((last_1_var_1_11) < (((16 - 32) + (64 + var_1_10)))) ? (last_1_var_1_11) : (((16 - 32) + (64 + var_1_10))))))))) && (var_1_13 ? (var_1_12 == ((unsigned short int) (var_1_14 - var_1_15))) : 1)) && ((var_1_1 <= (((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))) + var_1_1)) ? (var_1_16 == ((signed char) ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))))) : ((var_1_19 < var_1_20) ? (var_1_16 == ((signed char) (var_1_21 - var_1_22))) : (var_1_16 == ((signed char) var_1_10))))) && (((- (var_1_14 - var_1_24)) < var_1_10) ? (var_1_23 == ((unsigned long int) (var_1_24 + (var_1_22 + 4u)))) : (var_1_23 == ((unsigned long int) ((((var_1_14) < (var_1_12)) ? (var_1_14) : (var_1_12))))))) && ((var_1_6 != 49.125) ? ((((((64u) < 0 ) ? -(64u) : (64u))) < last_1_var_1_26) ? (var_1_26 == ((signed long int) var_1_15)) : 1) : 1) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=5, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=65534, var_1_49=5000004/5, var_1_5=2, var_1_7=32] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=1, var_1_11=1, var_1_12=65533, var_1_13=1, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_18=-63, var_1_19=-63, var_1_1=2, var_1_20=63, var_1_21=-1, var_1_22=1, var_1_23=5, var_1_24=0, var_1_26=50, var_1_27=4, var_1_29=511/8, var_1_31=64, var_1_32=23/4, var_1_37=0, var_1_39=65538, var_1_43=2147483647, var_1_44=2147483647, var_1_45=1, var_1_48=65534, var_1_49=5000004/5, var_1_5=2, var_1_7=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 54.2s, OverallIterations: 13, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10968 SdHoareTripleChecker+Valid, 12.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10933 mSDsluCounter, 12356 SdHoareTripleChecker+Invalid, 10.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10053 mSDsCounter, 4185 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15121 IncrementalHoareTripleChecker+Invalid, 19306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4185 mSolverCounterUnsat, 2303 mSDtfsCounter, 15121 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3211 GetRequests, 2574 SyntacticMatches, 2 SemanticMatches, 635 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29677 ImplicationChecksByTransitivity, 20.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=765occurred in iteration=9, InterpolantAutomatonStates: 518, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 4865 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 3798 NumberOfCodeBlocks, 3798 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3976 ConstructedInterpolants, 0 QuantifiedInterpolants, 28841 SizeOfPredicates, 41 NumberOfNonLiveVariables, 2314 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 33186/34800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 14:23:52,723 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-16 14:23:52,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.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 be1d1589c624dea5a45504e36955868605b81db28651b11be6c6e5b41a1451c9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:23:54,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:23:54,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 14:23:54,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:23:54,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:23:54,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:23:54,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:23:54,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:23:54,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:23:54,537 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:23:54,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:23:54,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:23:54,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:23:54,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:23:54,540 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:23:54,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:23:54,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:23:54,541 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:23:54,541 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:23:54,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:23:54,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:23:54,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:23:54,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:23:54,542 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 14:23:54,542 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 14:23:54,542 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:23:54,542 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 14:23:54,543 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:23:54,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:23:54,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:23:54,543 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:23:54,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:23:54,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:23:54,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:23:54,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:23:54,544 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:23:54,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:23:54,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:23:54,544 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 14:23:54,544 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 14:23:54,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:23:54,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:23:54,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:23:54,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:23:54,547 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 -> be1d1589c624dea5a45504e36955868605b81db28651b11be6c6e5b41a1451c9 [2024-11-16 14:23:54,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:23:54,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:23:54,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:23:54,837 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:23:54,838 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:23:54,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i [2024-11-16 14:23:56,244 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:23:56,407 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:23:56,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i [2024-11-16 14:23:56,423 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b40633a39/b69e365e29ec466988643c1a5e0a2e27/FLAG5acc683a6 [2024-11-16 14:23:56,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b40633a39/b69e365e29ec466988643c1a5e0a2e27 [2024-11-16 14:23:56,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:23:56,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:23:56,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:23:56,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:23:56,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:23:56,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:23:56" (1/1) ... [2024-11-16 14:23:56,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697881f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:56, skipping insertion in model container [2024-11-16 14:23:56,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:23:56" (1/1) ... [2024-11-16 14:23:56,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:23:57,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i[919,932] [2024-11-16 14:23:57,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:23:57,115 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:23:57,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i[919,932] [2024-11-16 14:23:57,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:23:57,189 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:23:57,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:57 WrapperNode [2024-11-16 14:23:57,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:23:57,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:23:57,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:23:57,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:23:57,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:57" (1/1) ... [2024-11-16 14:23:57,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:57" (1/1) ... [2024-11-16 14:23:57,247 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-11-16 14:23:57,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:23:57,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:23:57,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:23:57,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:23:57,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:57" (1/1) ... [2024-11-16 14:23:57,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:57" (1/1) ... [2024-11-16 14:23:57,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:57" (1/1) ... [2024-11-16 14:23:57,292 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 14:23:57,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:57" (1/1) ... [2024-11-16 14:23:57,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:57" (1/1) ... [2024-11-16 14:23:57,307 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:57" (1/1) ... [2024-11-16 14:23:57,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:57" (1/1) ... [2024-11-16 14:23:57,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:57" (1/1) ... [2024-11-16 14:23:57,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:57" (1/1) ... [2024-11-16 14:23:57,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:23:57,314 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:23:57,314 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:23:57,326 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:23:57,327 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:57" (1/1) ... [2024-11-16 14:23:57,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:23:57,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:23:57,361 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 14:23:57,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 14:23:57,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:23:57,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 14:23:57,409 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:23:57,409 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:23:57,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:23:57,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:23:57,490 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:23:57,492 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:24:08,769 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 14:24:08,771 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:24:08,790 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:24:08,791 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:24:08,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:24:08 BoogieIcfgContainer [2024-11-16 14:24:08,791 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:24:08,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:24:08,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:24:08,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:24:08,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:23:56" (1/3) ... [2024-11-16 14:24:08,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75abc0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:24:08, skipping insertion in model container [2024-11-16 14:24:08,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:57" (2/3) ... [2024-11-16 14:24:08,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75abc0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:24:08, skipping insertion in model container [2024-11-16 14:24:08,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:24:08" (3/3) ... [2024-11-16 14:24:08,804 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-43.i [2024-11-16 14:24:08,819 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:24:08,819 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:24:08,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:24:08,912 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;@4907b2b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:24:08,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:24:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 14:24:08,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-16 14:24:08,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:08,931 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:24:08,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:08,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:08,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1813409692, now seen corresponding path program 1 times [2024-11-16 14:24:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:24:08,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452595341] [2024-11-16 14:24:08,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:08,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:24:08,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:24:08,950 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:24:08,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 14:24:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:09,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 14:24:09,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:24:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 818 proven. 0 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2024-11-16 14:24:09,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:24:09,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:24:09,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452595341] [2024-11-16 14:24:09,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452595341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:24:09,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:24:09,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:24:09,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120251764] [2024-11-16 14:24:09,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:24:09,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:24:09,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:24:09,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:24:09,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:24:09,460 INFO L87 Difference]: Start difference. First operand has 93 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-16 14:24:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:24:09,495 INFO L93 Difference]: Finished difference Result 176 states and 309 transitions. [2024-11-16 14:24:09,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:24:09,498 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 195 [2024-11-16 14:24:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:24:09,504 INFO L225 Difference]: With dead ends: 176 [2024-11-16 14:24:09,505 INFO L226 Difference]: Without dead ends: 86 [2024-11-16 14:24:09,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:24:09,511 INFO L432 NwaCegarLoop]: 129 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, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:24:09,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:24:09,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-16 14:24:09,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-16 14:24:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 54 states have internal predecessors, (69), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 14:24:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 129 transitions. [2024-11-16 14:24:09,554 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 129 transitions. Word has length 195 [2024-11-16 14:24:09,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:24:09,561 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 129 transitions. [2024-11-16 14:24:09,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-16 14:24:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 129 transitions. [2024-11-16 14:24:09,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-16 14:24:09,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:09,564 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:24:09,580 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-16 14:24:09,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:24:09,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:09,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:09,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2087378395, now seen corresponding path program 1 times [2024-11-16 14:24:09,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:24:09,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33857162] [2024-11-16 14:24:09,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:09,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:24:09,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:24:09,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:24:09,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 14:24:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:10,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 14:24:10,227 INFO L278 TraceCheckSpWp]: Computing forward predicates...