./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-85.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 cc4a7aa458277533675aacdf7af943b27ec70a7d49ed5d9ca73af9a35907fc2d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:06:32,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:06:32,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:06:32,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:06:32,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:06:32,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:06:32,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:06:32,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:06:32,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:06:32,837 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:06:32,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:06:32,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:06:32,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:06:32,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:06:32,842 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:06:32,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:06:32,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:06:32,843 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:06:32,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:06:32,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:06:32,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:06:32,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:06:32,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:06:32,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:06:32,849 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:06:32,850 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:06:32,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:06:32,850 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:06:32,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:06:32,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:06:32,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:06:32,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:06:32,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:06:32,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:06:32,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:06:32,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:06:32,857 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:06:32,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:06:32,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:06:32,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:06:32,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:06:32,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:06:32,859 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-clean/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-clean/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 -> cc4a7aa458277533675aacdf7af943b27ec70a7d49ed5d9ca73af9a35907fc2d [2024-10-11 10:06:33,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:06:33,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:06:33,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:06:33,159 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:06:33,160 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:06:33,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-85.i [2024-10-11 10:06:34,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:06:34,946 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:06:34,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-85.i [2024-10-11 10:06:34,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/05660b8b3/111bb186be1e43c7b7a8b53239f45888/FLAG8a8c0d3e4 [2024-10-11 10:06:34,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/05660b8b3/111bb186be1e43c7b7a8b53239f45888 [2024-10-11 10:06:34,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:06:34,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:06:34,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:06:34,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:06:34,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:06:34,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:06:34" (1/1) ... [2024-10-11 10:06:34,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a5a4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:34, skipping insertion in model container [2024-10-11 10:06:34,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:06:34" (1/1) ... [2024-10-11 10:06:35,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:06:35,220 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-85.i[919,932] [2024-10-11 10:06:35,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:06:35,350 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:06:35,362 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-85.i[919,932] [2024-10-11 10:06:35,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:06:35,451 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:06:35,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:35 WrapperNode [2024-10-11 10:06:35,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:06:35,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:06:35,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:06:35,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:06:35,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:35" (1/1) ... [2024-10-11 10:06:35,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:35" (1/1) ... [2024-10-11 10:06:35,522 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-10-11 10:06:35,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:06:35,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:06:35,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:06:35,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:06:35,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:35" (1/1) ... [2024-10-11 10:06:35,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:35" (1/1) ... [2024-10-11 10:06:35,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:35" (1/1) ... [2024-10-11 10:06:35,576 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:06:35,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:35" (1/1) ... [2024-10-11 10:06:35,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:35" (1/1) ... [2024-10-11 10:06:35,593 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:35" (1/1) ... [2024-10-11 10:06:35,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:35" (1/1) ... [2024-10-11 10:06:35,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:35" (1/1) ... [2024-10-11 10:06:35,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:35" (1/1) ... [2024-10-11 10:06:35,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:06:35,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:06:35,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:06:35,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:06:35,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:35" (1/1) ... [2024-10-11 10:06:35,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:06:35,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:06:35,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:06:35,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:06:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:06:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:06:35,708 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:06:35,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:06:35,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:06:35,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:06:35,803 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:06:35,805 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:06:36,267 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 10:06:36,268 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:06:36,318 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:06:36,318 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:06:36,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:06:36 BoogieIcfgContainer [2024-10-11 10:06:36,318 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:06:36,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:06:36,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:06:36,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:06:36,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:06:34" (1/3) ... [2024-10-11 10:06:36,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387445e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:06:36, skipping insertion in model container [2024-10-11 10:06:36,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:35" (2/3) ... [2024-10-11 10:06:36,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387445e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:06:36, skipping insertion in model container [2024-10-11 10:06:36,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:06:36" (3/3) ... [2024-10-11 10:06:36,332 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-85.i [2024-10-11 10:06:36,347 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:06:36,347 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:06:36,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:06:36,412 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;@14e91e16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:06:36,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:06:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 48 states have (on average 1.5) internal successors, (72), 49 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 10:06:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 10:06:36,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:36,436 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:36,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:36,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:36,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1944576088, now seen corresponding path program 1 times [2024-10-11 10:06:36,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:36,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272417813] [2024-10-11 10:06:36,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:36,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:06:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:06:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:06:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:06:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:06:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:06:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:06:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 10:06:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:06:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:06:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:06:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:06:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 10:06:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:06:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:06:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:06:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:06:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:06:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:06:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:06:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 10:06:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:36,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:06:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 10:06:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 10:06:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 10:06:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 10:06:37,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:37,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272417813] [2024-10-11 10:06:37,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272417813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:06:37,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:06:37,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:06:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440095043] [2024-10-11 10:06:37,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:06:37,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:06:37,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:37,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:06:37,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:06:37,076 INFO L87 Difference]: Start difference. First operand has 76 states, 48 states have (on average 1.5) internal successors, (72), 49 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 10:06:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:37,207 INFO L93 Difference]: Finished difference Result 149 states and 267 transitions. [2024-10-11 10:06:37,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:06:37,261 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 158 [2024-10-11 10:06:37,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:37,278 INFO L225 Difference]: With dead ends: 149 [2024-10-11 10:06:37,278 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 10:06:37,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:06:37,288 INFO L432 NwaCegarLoop]: 114 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, 114 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:37,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:06:37,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 10:06:37,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-11 10:06:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.425531914893617) internal successors, (67), 47 states have internal predecessors, (67), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 10:06:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 117 transitions. [2024-10-11 10:06:37,366 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 117 transitions. Word has length 158 [2024-10-11 10:06:37,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:37,369 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 117 transitions. [2024-10-11 10:06:37,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 10:06:37,370 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 117 transitions. [2024-10-11 10:06:37,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 10:06:37,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:37,379 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:37,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:06:37,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:37,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:37,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1343132446, now seen corresponding path program 1 times [2024-10-11 10:06:37,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:37,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031729998] [2024-10-11 10:06:37,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:37,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:06:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:06:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:06:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:06:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:06:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:06:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:06:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 10:06:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:06:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:06:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:06:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:06:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 10:06:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:06:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:06:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:06:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:06:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:06:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:06:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:06:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 10:06:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:37,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:06:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:38,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 10:06:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:38,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 10:06:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:38,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 10:06:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 10:06:38,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:38,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031729998] [2024-10-11 10:06:38,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031729998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:06:38,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:06:38,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:06:38,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157311187] [2024-10-11 10:06:38,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:06:38,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:06:38,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:38,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:06:38,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:06:38,032 INFO L87 Difference]: Start difference. First operand 74 states and 117 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 10:06:38,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:38,122 INFO L93 Difference]: Finished difference Result 208 states and 332 transitions. [2024-10-11 10:06:38,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:06:38,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 158 [2024-10-11 10:06:38,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:38,127 INFO L225 Difference]: With dead ends: 208 [2024-10-11 10:06:38,127 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 10:06:38,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:06:38,129 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 56 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:38,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 217 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:06:38,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 10:06:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 122. [2024-10-11 10:06:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 69 states have (on average 1.318840579710145) internal successors, (91), 69 states have internal predecessors, (91), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 10:06:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 191 transitions. [2024-10-11 10:06:38,171 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 191 transitions. Word has length 158 [2024-10-11 10:06:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:38,173 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 191 transitions. [2024-10-11 10:06:38,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 10:06:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 191 transitions. [2024-10-11 10:06:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 10:06:38,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:38,176 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:38,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:06:38,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:38,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:38,177 INFO L85 PathProgramCache]: Analyzing trace with hash -377502352, now seen corresponding path program 1 times [2024-10-11 10:06:38,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:38,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368413304] [2024-10-11 10:06:38,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:38,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:38,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:06:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:38,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:06:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:38,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:06:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:38,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:06:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:38,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:06:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:38,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:06:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:38,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:06:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:38,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 10:06:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:06:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:38,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:06:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:38,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:06:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:38,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:06:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:38,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 10:06:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:38,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:06:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:39,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:06:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:39,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:06:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:39,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:06:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:39,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:06:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:39,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:06:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:39,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:06:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:39,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 10:06:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:39,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:06:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:39,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 10:06:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:39,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 10:06:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:39,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 10:06:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:39,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 10:06:39,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:39,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368413304] [2024-10-11 10:06:39,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368413304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:06:39,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:06:39,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:06:39,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153865282] [2024-10-11 10:06:39,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:06:39,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:06:39,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:39,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:06:39,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:06:39,096 INFO L87 Difference]: Start difference. First operand 122 states and 191 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 10:06:39,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:39,588 INFO L93 Difference]: Finished difference Result 221 states and 348 transitions. [2024-10-11 10:06:39,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:06:39,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 159 [2024-10-11 10:06:39,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:39,592 INFO L225 Difference]: With dead ends: 221 [2024-10-11 10:06:39,592 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 10:06:39,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:06:39,598 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 92 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:39,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 353 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 10:06:39,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 10:06:39,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 131. [2024-10-11 10:06:39,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 78 states have (on average 1.358974358974359) internal successors, (106), 78 states have internal predecessors, (106), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 10:06:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 206 transitions. [2024-10-11 10:06:39,642 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 206 transitions. Word has length 159 [2024-10-11 10:06:39,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:39,645 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 206 transitions. [2024-10-11 10:06:39,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 10:06:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 206 transitions. [2024-10-11 10:06:39,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 10:06:39,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:39,648 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:39,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:06:39,652 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:39,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:39,652 INFO L85 PathProgramCache]: Analyzing trace with hash 711079477, now seen corresponding path program 1 times [2024-10-11 10:06:39,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:39,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721070421] [2024-10-11 10:06:39,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:39,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:06:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:06:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:06:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:06:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:06:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:06:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:06:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 10:06:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:06:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:06:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:06:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:06:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 10:06:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:06:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:06:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:06:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:06:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:06:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:06:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:06:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 10:06:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:06:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 10:06:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 10:06:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 10:06:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:40,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 10:06:40,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:40,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721070421] [2024-10-11 10:06:40,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721070421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:06:40,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:06:40,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:06:40,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328557414] [2024-10-11 10:06:40,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:06:40,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:06:40,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:40,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:06:40,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:06:40,508 INFO L87 Difference]: Start difference. First operand 131 states and 206 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 10:06:40,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:40,892 INFO L93 Difference]: Finished difference Result 234 states and 365 transitions. [2024-10-11 10:06:40,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 10:06:40,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 160 [2024-10-11 10:06:40,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:40,897 INFO L225 Difference]: With dead ends: 234 [2024-10-11 10:06:40,897 INFO L226 Difference]: Without dead ends: 161 [2024-10-11 10:06:40,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:06:40,903 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 120 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:40,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 353 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:06:40,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-11 10:06:40,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 139. [2024-10-11 10:06:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 10:06:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 218 transitions. [2024-10-11 10:06:40,985 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 218 transitions. Word has length 160 [2024-10-11 10:06:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:40,988 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 218 transitions. [2024-10-11 10:06:40,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 10:06:40,988 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 218 transitions. [2024-10-11 10:06:40,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 10:06:40,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:40,990 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:40,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:06:40,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:40,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:40,991 INFO L85 PathProgramCache]: Analyzing trace with hash 768337779, now seen corresponding path program 1 times [2024-10-11 10:06:40,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:40,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424316357] [2024-10-11 10:06:40,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:40,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:06:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:06:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:06:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:06:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:06:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:06:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:06:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 10:06:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:06:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:06:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:06:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:06:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 10:06:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:06:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:06:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:06:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:06:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:06:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:06:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:06:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 10:06:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:06:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 10:06:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 10:06:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 10:06:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 3 proven. 69 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 10:06:41,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:41,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424316357] [2024-10-11 10:06:41,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424316357] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:06:41,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173601375] [2024-10-11 10:06:41,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:41,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:06:41,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:06:41,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:06:41,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:06:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:41,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 10:06:41,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:06:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 624 proven. 36 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-10-11 10:06:41,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:06:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 10:06:42,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173601375] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:06:42,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 10:06:42,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 11 [2024-10-11 10:06:42,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230272019] [2024-10-11 10:06:42,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 10:06:42,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 10:06:42,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:42,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 10:06:42,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:06:42,163 INFO L87 Difference]: Start difference. First operand 139 states and 218 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 3 states have call successors, (60), 2 states have call predecessors, (60), 4 states have return successors, (62), 3 states have call predecessors, (62), 3 states have call successors, (62) [2024-10-11 10:06:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:43,006 INFO L93 Difference]: Finished difference Result 336 states and 497 transitions. [2024-10-11 10:06:43,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 10:06:43,006 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 3 states have call successors, (60), 2 states have call predecessors, (60), 4 states have return successors, (62), 3 states have call predecessors, (62), 3 states have call successors, (62) Word has length 160 [2024-10-11 10:06:43,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:43,009 INFO L225 Difference]: With dead ends: 336 [2024-10-11 10:06:43,009 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 10:06:43,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 363 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 10:06:43,011 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 346 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:43,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 301 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 10:06:43,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 10:06:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 218. [2024-10-11 10:06:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 133 states have (on average 1.2406015037593985) internal successors, (165), 133 states have internal predecessors, (165), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-11 10:06:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 315 transitions. [2024-10-11 10:06:43,092 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 315 transitions. Word has length 160 [2024-10-11 10:06:43,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:43,093 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 315 transitions. [2024-10-11 10:06:43,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 3 states have call successors, (60), 2 states have call predecessors, (60), 4 states have return successors, (62), 3 states have call predecessors, (62), 3 states have call successors, (62) [2024-10-11 10:06:43,093 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 315 transitions. [2024-10-11 10:06:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 10:06:43,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:43,097 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:43,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 10:06:43,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:06:43,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:43,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:43,303 INFO L85 PathProgramCache]: Analyzing trace with hash 617596927, now seen corresponding path program 1 times [2024-10-11 10:06:43,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:43,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798455448] [2024-10-11 10:06:43,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:43,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:06:43,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [901489928] [2024-10-11 10:06:43,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:43,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:06:43,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:06:43,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:06:43,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 10:06:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:06:43,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:06:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:06:43,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:06:43,938 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:06:43,939 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:06:43,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 10:06:44,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:06:44,145 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 10:06:44,272 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:06:44,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:06:44 BoogieIcfgContainer [2024-10-11 10:06:44,276 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:06:44,276 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:06:44,276 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:06:44,276 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:06:44,277 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:06:36" (3/4) ... [2024-10-11 10:06:44,279 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:06:44,280 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:06:44,281 INFO L158 Benchmark]: Toolchain (without parser) took 9298.25ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 94.4MB in the beginning and 145.4MB in the end (delta: -51.0MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2024-10-11 10:06:44,281 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 167.8MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:06:44,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.26ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 134.9MB in the end (delta: -40.8MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-10-11 10:06:44,282 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.75ms. Allocated memory is still 167.8MB. Free memory was 134.9MB in the beginning and 135.1MB in the end (delta: -217.0kB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2024-10-11 10:06:44,282 INFO L158 Benchmark]: Boogie Preprocessor took 87.98ms. Allocated memory is still 167.8MB. Free memory was 135.1MB in the beginning and 128.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 10:06:44,282 INFO L158 Benchmark]: RCFGBuilder took 703.34ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 99.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 10:06:44,282 INFO L158 Benchmark]: TraceAbstraction took 7951.38ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 99.4MB in the beginning and 145.4MB in the end (delta: -46.0MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2024-10-11 10:06:44,283 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 253.8MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:06:44,284 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.27ms. Allocated memory is still 167.8MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 468.26ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 134.9MB in the end (delta: -40.8MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.75ms. Allocated memory is still 167.8MB. Free memory was 134.9MB in the beginning and 135.1MB in the end (delta: -217.0kB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.98ms. Allocated memory is still 167.8MB. Free memory was 135.1MB in the beginning and 128.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 703.34ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 99.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7951.38ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 99.4MB in the beginning and 145.4MB in the end (delta: -46.0MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 253.8MB. Free memory is still 145.4MB. 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 176, overapproximation of someBinaryDOUBLEComparisonOperation at line 176. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1000; [L23] unsigned char var_1_5 = 1; [L24] unsigned char var_1_6 = 0; [L25] float var_1_7 = 0.6; [L26] unsigned long int var_1_8 = 32; [L27] unsigned long int var_1_9 = 32; [L28] float var_1_11 = 5.5; [L29] unsigned long int var_1_12 = 128; [L30] unsigned char var_1_13 = 16; [L31] unsigned char var_1_14 = 0; [L32] unsigned long int var_1_15 = 8; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] double var_1_18 = 1.8; [L36] double var_1_19 = 4.5; [L37] double var_1_20 = 15.5; [L38] signed char var_1_21 = -5; [L39] signed char var_1_27 = 4; [L40] float var_1_28 = 8.95; [L41] signed short int var_1_30 = -256; [L42] unsigned char var_1_31 = 0; [L43] unsigned char var_1_35 = 1; [L44] unsigned char var_1_36 = 0; [L45] unsigned char var_1_37 = 0; [L46] unsigned char var_1_38 = 1; [L47] unsigned short int var_1_39 = 4; [L48] unsigned char var_1_41 = 10; [L49] unsigned long int last_1_var_1_1 = 1000; [L50] unsigned char last_1_var_1_5 = 1; [L51] unsigned long int last_1_var_1_12 = 128; [L52] unsigned char last_1_var_1_13 = 16; [L53] unsigned long int last_1_var_1_15 = 8; [L180] isInitial = 1 [L181] FCALL initially() [L182] COND TRUE 1 [L183] CALL updateLastVariables() [L169] last_1_var_1_1 = var_1_1 [L170] last_1_var_1_5 = var_1_5 [L171] last_1_var_1_12 = var_1_12 [L172] last_1_var_1_13 = var_1_13 [L173] last_1_var_1_15 = var_1_15 [L183] RET updateLastVariables() [L184] CALL updateVariables() [L129] var_1_6 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L130] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L131] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L131] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L132] var_1_8 = __VERIFIER_nondet_ulong() [L133] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L133] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L134] CALL assume_abort_if_not(var_1_8 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L134] RET assume_abort_if_not(var_1_8 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L135] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=32] [L135] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=32] [L136] var_1_9 = __VERIFIER_nondet_ulong() [L137] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262] [L137] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262] [L138] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262] [L138] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262] [L139] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L139] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L140] var_1_11 = __VERIFIER_nondet_float() [L141] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L141] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L142] var_1_14 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L143] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L144] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L145] var_1_17 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L146] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L147] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L148] var_1_19 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L149] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L150] var_1_20 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L151] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=4, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L152] var_1_27 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L153] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L154] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L154] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L155] var_1_35 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_35 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L156] RET assume_abort_if_not(var_1_35 >= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L157] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L158] var_1_36 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_36 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L159] RET assume_abort_if_not(var_1_36 >= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L160] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=4, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L161] var_1_39 = __VERIFIER_nondet_ushort() [L162] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L162] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_39 <= 15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L163] RET assume_abort_if_not(var_1_39 <= 15) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=10, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L164] var_1_41 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_41 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L165] RET assume_abort_if_not(var_1_41 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_41 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L166] RET assume_abort_if_not(var_1_41 <= 63) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L184] RET updateVariables() [L185] CALL step() [L57] COND TRUE \read(var_1_5) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L58] COND TRUE (var_1_14 - ((((var_1_13) < (var_1_13)) ? (var_1_13) : (var_1_13)))) <= var_1_13 [L59] var_1_21 = var_1_27 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-127, var_1_27=-127, var_1_28=179/20, var_1_30=-256, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L62] var_1_28 = var_1_19 [L63] var_1_30 = ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=1000, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L64] COND FALSE !((((((var_1_20 - var_1_20)) < (var_1_11)) ? ((var_1_20 - var_1_20)) : (var_1_11))) > (var_1_19 * 31.3)) [L69] var_1_31 = (var_1_35 && ((var_1_13 > var_1_13) && (! var_1_36))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=1000, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L71] COND TRUE (var_1_7 / 25.4f) >= ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) [L72] var_1_37 = (! (var_1_36 || var_1_35)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=1000, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L74] COND TRUE ! var_1_6 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=1000, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L75] EXPR (var_1_13 + var_1_14) << ((((5) < (var_1_39)) ? (5) : (var_1_39))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=1000, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=1, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L75] COND TRUE (var_1_9 + var_1_13) >= ((var_1_13 + var_1_14) << ((((5) < (var_1_39)) ? (5) : (var_1_39)))) [L76] COND FALSE !(var_1_17 && (4.166 >= var_1_20)) [L79] var_1_38 = (128 - (var_1_39 + var_1_41)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=1000, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L89] signed long int stepLocal_1 = last_1_var_1_13; [L90] signed long int stepLocal_0 = last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_1=16, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=1000, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L91] COND TRUE stepLocal_1 < ((- last_1_var_1_12) * 64) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=1000, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L92] COND TRUE \read(last_1_var_1_5) [L93] var_1_1 = ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L102] unsigned long int stepLocal_2 = last_1_var_1_15 + last_1_var_1_1; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_2=1008, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_41=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L103] COND TRUE last_1_var_1_13 <= stepLocal_2 [L104] var_1_5 = ((last_1_var_1_15 == last_1_var_1_13) && var_1_6) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L108] unsigned char stepLocal_3 = var_1_5; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_3=0, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L109] COND FALSE !(stepLocal_3 || var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L112] var_1_13 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) [L113] var_1_16 = (var_1_6 && var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=1, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L114] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=1, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=-4294967262, var_1_9=1] [L117] COND FALSE !((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) [L122] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=3, var_1_12=128, var_1_13=1, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=-4294967262, var_1_9=1] [L124] COND TRUE var_1_7 <= (- (32.8f + var_1_7)) [L125] var_1_12 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=3, var_1_12=128, var_1_13=1, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=-4294967262, var_1_9=1] [L185] RET step() [L186] CALL, EXPR property() [L176-L177] return ((((((((last_1_var_1_13 < ((- last_1_var_1_12) * 64)) ? (last_1_var_1_5 ? (var_1_1 == ((unsigned long int) ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))))) : ((-10000000 < last_1_var_1_13) ? (var_1_1 == ((unsigned long int) (((((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) < 0 ) ? -((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) : ((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))))))) : (var_1_1 == ((unsigned long int) 50u)))) : 1) && ((last_1_var_1_13 <= (last_1_var_1_15 + last_1_var_1_1)) ? (var_1_5 == ((unsigned char) ((last_1_var_1_15 == last_1_var_1_13) && var_1_6))) : (var_1_5 == ((unsigned char) var_1_6)))) && (((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) ? ((1.25f < var_1_18) ? (var_1_7 == ((float) 1000000.1f)) : 1) : (var_1_7 == ((float) var_1_11)))) && ((var_1_7 <= (- (32.8f + var_1_7))) ? (var_1_12 == ((unsigned long int) last_1_var_1_12)) : 1)) && (var_1_13 == ((unsigned char) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) && (var_1_5 ? (var_1_15 == ((unsigned long int) ((((var_1_1) > ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) ? (var_1_1) : ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))))))) : 1)) && (var_1_16 == ((unsigned char) (var_1_6 && var_1_17)))) && ((var_1_5 || var_1_17) ? (var_1_18 == ((double) ((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) + var_1_20) - 63.6))) : 1) ; [L186] RET, EXPR property() [L186] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=3, var_1_12=128, var_1_13=1, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=-4294967262, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=3, var_1_12=128, var_1_13=1, var_1_14=1, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=2, var_1_1=128, var_1_21=-127, var_1_27=-127, var_1_28=2, var_1_30=16, var_1_31=0, var_1_35=1, var_1_36=1, var_1_37=0, var_1_38=128, var_1_39=0, var_1_41=0, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=-4294967262, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 6, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 616 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 614 mSDsluCounter, 1338 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 826 mSDsCounter, 417 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 554 IncrementalHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 417 mSolverCounterUnsat, 512 mSDtfsCounter, 554 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 643 GetRequests, 597 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=5, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 85 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1281 NumberOfCodeBlocks, 1281 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1108 ConstructedInterpolants, 0 QuantifiedInterpolants, 4478 SizeOfPredicates, 3 NumberOfNonLiveVariables, 386 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 8259/8400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 10:06:44,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-85.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 cc4a7aa458277533675aacdf7af943b27ec70a7d49ed5d9ca73af9a35907fc2d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:06:46,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:06:46,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:06:46,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:06:46,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:06:46,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:06:46,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:06:46,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:06:46,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:06:46,697 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:06:46,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:06:46,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:06:46,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:06:46,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:06:46,698 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:06:46,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:06:46,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:06:46,699 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:06:46,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:06:46,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:06:46,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:06:46,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:06:46,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:06:46,702 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:06:46,703 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:06:46,703 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:06:46,704 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:06:46,704 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:06:46,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:06:46,705 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:06:46,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:06:46,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:06:46,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:06:46,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:06:46,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:06:46,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:06:46,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:06:46,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:06:46,709 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:06:46,709 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:06:46,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:06:46,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:06:46,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:06:46,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:06:46,711 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:06:46,711 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-clean/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-clean/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 -> cc4a7aa458277533675aacdf7af943b27ec70a7d49ed5d9ca73af9a35907fc2d [2024-10-11 10:06:47,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:06:47,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:06:47,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:06:47,093 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:06:47,093 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:06:47,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-85.i [2024-10-11 10:06:48,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:06:48,955 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:06:48,956 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-85.i [2024-10-11 10:06:48,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5e9b4403d/2b050a67f7e74c30ba291a157853467a/FLAG3ccef95bf [2024-10-11 10:06:48,980 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5e9b4403d/2b050a67f7e74c30ba291a157853467a [2024-10-11 10:06:48,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:06:48,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:06:48,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:06:48,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:06:48,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:06:48,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:06:48" (1/1) ... [2024-10-11 10:06:48,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2b0ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:48, skipping insertion in model container [2024-10-11 10:06:48,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:06:48" (1/1) ... [2024-10-11 10:06:49,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:06:49,220 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-85.i[919,932] [2024-10-11 10:06:49,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:06:49,336 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:06:49,347 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-85.i[919,932] [2024-10-11 10:06:49,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:06:49,414 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:06:49,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:49 WrapperNode [2024-10-11 10:06:49,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:06:49,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:06:49,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:06:49,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:06:49,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:49" (1/1) ... [2024-10-11 10:06:49,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:49" (1/1) ... [2024-10-11 10:06:49,480 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-10-11 10:06:49,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:06:49,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:06:49,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:06:49,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:06:49,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:49" (1/1) ... [2024-10-11 10:06:49,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:49" (1/1) ... [2024-10-11 10:06:49,501 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:49" (1/1) ... [2024-10-11 10:06:49,521 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:06:49,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:49" (1/1) ... [2024-10-11 10:06:49,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:49" (1/1) ... [2024-10-11 10:06:49,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:49" (1/1) ... [2024-10-11 10:06:49,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:49" (1/1) ... [2024-10-11 10:06:49,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:49" (1/1) ... [2024-10-11 10:06:49,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:49" (1/1) ... [2024-10-11 10:06:49,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:06:49,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:06:49,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:06:49,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:06:49,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:49" (1/1) ... [2024-10-11 10:06:49,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:06:49,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:06:49,605 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:06:49,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:06:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:06:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:06:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:06:49,655 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:06:49,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:06:49,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:06:49,760 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:06:49,762 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:07:00,789 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 10:07:00,790 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:07:00,855 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:07:00,855 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:07:00,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:07:00 BoogieIcfgContainer [2024-10-11 10:07:00,856 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:07:00,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:07:00,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:07:00,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:07:00,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:06:48" (1/3) ... [2024-10-11 10:07:00,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647cd938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:07:00, skipping insertion in model container [2024-10-11 10:07:00,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:49" (2/3) ... [2024-10-11 10:07:00,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647cd938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:07:00, skipping insertion in model container [2024-10-11 10:07:00,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:07:00" (3/3) ... [2024-10-11 10:07:00,867 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-85.i [2024-10-11 10:07:00,884 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:07:00,885 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:07:00,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:07:00,971 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;@512a7251, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:07:00,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:07:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 46 states have (on average 1.5) internal successors, (69), 47 states have internal predecessors, (69), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 10:07:00,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 10:07:00,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:07:00,989 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:07:00,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:07:00,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:07:00,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1237581311, now seen corresponding path program 1 times [2024-10-11 10:07:01,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:07:01,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069138290] [2024-10-11 10:07:01,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:07:01,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:07:01,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:07:01,012 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:07:01,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 10:07:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:01,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 10:07:01,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:07:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 10:07:03,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:07:03,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:07:03,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069138290] [2024-10-11 10:07:03,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069138290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:07:03,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:07:03,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:07:03,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653213820] [2024-10-11 10:07:03,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:07:03,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:07:03,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:07:03,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:07:03,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:07:03,708 INFO L87 Difference]: Start difference. First operand has 74 states, 46 states have (on average 1.5) internal successors, (69), 47 states have internal predecessors, (69), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 10:07:06,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:07:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:07:06,526 INFO L93 Difference]: Finished difference Result 204 states and 385 transitions. [2024-10-11 10:07:06,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:07:06,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 158 [2024-10-11 10:07:06,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:07:06,538 INFO L225 Difference]: With dead ends: 204 [2024-10-11 10:07:06,538 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 10:07:06,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:07:06,544 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 25 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 10:07:06,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 211 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 10:07:06,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 10:07:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2024-10-11 10:07:06,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 10:07:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 188 transitions. [2024-10-11 10:07:06,613 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 188 transitions. Word has length 158 [2024-10-11 10:07:06,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:07:06,616 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 188 transitions. [2024-10-11 10:07:06,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 10:07:06,617 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 188 transitions. [2024-10-11 10:07:06,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 10:07:06,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:07:06,623 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:07:06,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 10:07:06,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:07:06,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:07:06,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:07:06,826 INFO L85 PathProgramCache]: Analyzing trace with hash -16826445, now seen corresponding path program 1 times [2024-10-11 10:07:06,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:07:06,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435949506] [2024-10-11 10:07:06,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:07:06,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:07:06,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:07:06,830 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:07:06,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 10:07:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:07,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 10:07:07,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:07:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 10:07:11,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:07:11,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:07:11,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435949506] [2024-10-11 10:07:11,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435949506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:07:11,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:07:11,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:07:11,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614899399] [2024-10-11 10:07:11,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:07:11,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:07:11,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:07:11,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:07:11,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:07:11,213 INFO L87 Difference]: Start difference. First operand 120 states and 188 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 10:07:14,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:07:18,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:07:21,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:07:22,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:07:26,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:07:27,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:07:28,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:07:28,718 INFO L93 Difference]: Finished difference Result 262 states and 414 transitions. [2024-10-11 10:07:28,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:07:28,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 159 [2024-10-11 10:07:28,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:07:28,723 INFO L225 Difference]: With dead ends: 262 [2024-10-11 10:07:28,723 INFO L226 Difference]: Without dead ends: 191 [2024-10-11 10:07:28,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:07:28,726 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 38 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:07:28,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 200 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 17.5s Time] [2024-10-11 10:07:28,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-11 10:07:28,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2024-10-11 10:07:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 110 states have (on average 1.3454545454545455) internal successors, (148), 110 states have internal predecessors, (148), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-11 10:07:28,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 298 transitions. [2024-10-11 10:07:28,775 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 298 transitions. Word has length 159 [2024-10-11 10:07:28,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:07:28,779 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 298 transitions. [2024-10-11 10:07:28,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 10:07:28,779 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 298 transitions. [2024-10-11 10:07:28,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 10:07:28,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:07:28,785 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:07:28,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 10:07:28,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:07:28,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:07:28,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:07:28,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1296690123, now seen corresponding path program 1 times [2024-10-11 10:07:28,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:07:28,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688687116] [2024-10-11 10:07:28,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:07:28,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:07:28,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:07:28,992 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:07:28,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 10:07:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:29,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 10:07:29,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:07:31,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 118 proven. 69 refuted. 0 times theorem prover too weak. 1013 trivial. 0 not checked. [2024-10-11 10:07:31,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:07:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 3 proven. 69 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 10:07:32,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:07:32,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688687116] [2024-10-11 10:07:32,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688687116] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:07:32,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:07:32,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-11 10:07:32,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492927245] [2024-10-11 10:07:32,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:07:32,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 10:07:32,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:07:32,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 10:07:32,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:07:32,345 INFO L87 Difference]: Start difference. First operand 189 states and 298 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-10-11 10:07:35,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:07:35,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:07:35,153 INFO L93 Difference]: Finished difference Result 353 states and 542 transitions. [2024-10-11 10:07:35,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:07:35,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 159 [2024-10-11 10:07:35,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:07:35,184 INFO L225 Difference]: With dead ends: 353 [2024-10-11 10:07:35,184 INFO L226 Difference]: Without dead ends: 213 [2024-10-11 10:07:35,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:07:35,186 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 81 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 10:07:35,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 189 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 10:07:35,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-11 10:07:35,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 201. [2024-10-11 10:07:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 119 states have (on average 1.3025210084033614) internal successors, (155), 119 states have internal predecessors, (155), 75 states have call successors, (75), 6 states have call predecessors, (75), 6 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-11 10:07:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 305 transitions. [2024-10-11 10:07:35,227 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 305 transitions. Word has length 159 [2024-10-11 10:07:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:07:35,228 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 305 transitions. [2024-10-11 10:07:35,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-10-11 10:07:35,230 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 305 transitions. [2024-10-11 10:07:35,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 10:07:35,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:07:35,234 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:07:35,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 10:07:35,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:07:35,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:07:35,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:07:35,436 INFO L85 PathProgramCache]: Analyzing trace with hash 438416293, now seen corresponding path program 1 times [2024-10-11 10:07:35,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:07:35,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874140240] [2024-10-11 10:07:35,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:07:35,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:07:35,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:07:35,441 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:07:35,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 10:07:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:36,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 10:07:36,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:07:37,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 10:07:37,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:07:37,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:07:37,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874140240] [2024-10-11 10:07:37,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874140240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:07:37,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:07:37,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:07:37,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865478309] [2024-10-11 10:07:37,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:07:37,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:07:37,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:07:37,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:07:37,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:07:37,426 INFO L87 Difference]: Start difference. First operand 201 states and 305 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 10:07:40,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:07:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:07:40,358 INFO L93 Difference]: Finished difference Result 349 states and 532 transitions. [2024-10-11 10:07:40,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:07:40,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2024-10-11 10:07:40,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:07:40,387 INFO L225 Difference]: With dead ends: 349 [2024-10-11 10:07:40,387 INFO L226 Difference]: Without dead ends: 201 [2024-10-11 10:07:40,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:07:40,389 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 95 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 10:07:40,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 158 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 10:07:40,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-11 10:07:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-10-11 10:07:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 119 states have (on average 1.2857142857142858) internal successors, (153), 119 states have internal predecessors, (153), 75 states have call successors, (75), 6 states have call predecessors, (75), 6 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-11 10:07:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 303 transitions. [2024-10-11 10:07:40,422 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 303 transitions. Word has length 161 [2024-10-11 10:07:40,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:07:40,422 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 303 transitions. [2024-10-11 10:07:40,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 10:07:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 303 transitions. [2024-10-11 10:07:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 10:07:40,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:07:40,427 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:07:40,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 10:07:40,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:07:40,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:07:40,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:07:40,628 INFO L85 PathProgramCache]: Analyzing trace with hash 234753689, now seen corresponding path program 1 times [2024-10-11 10:07:40,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:07:40,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023157078] [2024-10-11 10:07:40,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:07:40,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:07:40,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:07:40,631 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:07:40,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 10:07:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:41,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 10:07:41,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:07:45,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 624 proven. 36 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-10-11 10:07:45,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:07:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 10:07:47,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:07:47,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023157078] [2024-10-11 10:07:47,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023157078] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:07:47,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:07:47,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2024-10-11 10:07:47,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248696406] [2024-10-11 10:07:47,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:07:47,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 10:07:47,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:07:47,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 10:07:47,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-11 10:07:47,760 INFO L87 Difference]: Start difference. First operand 201 states and 303 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 4 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) [2024-10-11 10:07:53,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:07:56,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []