./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '734c3c8d8fcb1b5f511dd20f78d90b7e50c76be5359a62f6160d8ac75ffd147b'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 734c3c8d8fcb1b5f511dd20f78d90b7e50c76be5359a62f6160d8ac75ffd147b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:47:02,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:47:02,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 05:47:02,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:47:02,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:47:02,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:47:02,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:47:02,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:47:02,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:47:02,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:47:02,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:47:02,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:47:02,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:47:02,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:47:02,948 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:47:02,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:47:02,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:47:02,949 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:47:02,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:47:02,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:47:02,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:47:02,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:47:02,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:47:02,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:47:02,949 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:47:02,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:47:02,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:47:02,950 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:47:02,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:47:02,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:47:02,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:47:02,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:47:02,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:47:02,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:47:02,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:47:02,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:47:02,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:47:02,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:47:02,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:47:02,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:47:02,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:47:02,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:47:02,951 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 734c3c8d8fcb1b5f511dd20f78d90b7e50c76be5359a62f6160d8ac75ffd147b [2024-11-07 05:47:03,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:47:03,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:47:03,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:47:03,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:47:03,346 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:47:03,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i [2024-11-07 05:47:04,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:47:05,060 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:47:05,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i [2024-11-07 05:47:05,073 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5c560744/63d2c47d58974764810a09920743a51b/FLAGf838b1a24 [2024-11-07 05:47:05,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5c560744/63d2c47d58974764810a09920743a51b [2024-11-07 05:47:05,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:47:05,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:47:05,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:47:05,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:47:05,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:47:05,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:47:05" (1/1) ... [2024-11-07 05:47:05,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bcd92b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:05, skipping insertion in model container [2024-11-07 05:47:05,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:47:05" (1/1) ... [2024-11-07 05:47:05,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:47:05,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i[919,932] [2024-11-07 05:47:05,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:47:05,348 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:47:05,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i[919,932] [2024-11-07 05:47:05,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:47:05,417 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:47:05,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:05 WrapperNode [2024-11-07 05:47:05,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:47:05,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:47:05,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:47:05,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:47:05,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:05" (1/1) ... [2024-11-07 05:47:05,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:05" (1/1) ... [2024-11-07 05:47:05,473 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2024-11-07 05:47:05,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:47:05,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:47:05,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:47:05,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:47:05,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:05" (1/1) ... [2024-11-07 05:47:05,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:05" (1/1) ... [2024-11-07 05:47:05,491 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:05" (1/1) ... [2024-11-07 05:47:05,519 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 05:47:05,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:05" (1/1) ... [2024-11-07 05:47:05,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:05" (1/1) ... [2024-11-07 05:47:05,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:05" (1/1) ... [2024-11-07 05:47:05,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:05" (1/1) ... [2024-11-07 05:47:05,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:05" (1/1) ... [2024-11-07 05:47:05,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:05" (1/1) ... [2024-11-07 05:47:05,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:47:05,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:47:05,557 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:47:05,557 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:47:05,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:05" (1/1) ... [2024-11-07 05:47:05,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:47:05,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:47:05,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 05:47:05,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 05:47:05,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:47:05,618 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:47:05,618 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:47:05,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:47:05,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:47:05,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:47:05,708 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:47:05,710 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:47:06,149 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 05:47:06,150 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:47:06,162 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:47:06,164 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:47:06,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:47:06 BoogieIcfgContainer [2024-11-07 05:47:06,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:47:06,167 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:47:06,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:47:06,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:47:06,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:47:05" (1/3) ... [2024-11-07 05:47:06,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed0fcea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:47:06, skipping insertion in model container [2024-11-07 05:47:06,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:05" (2/3) ... [2024-11-07 05:47:06,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed0fcea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:47:06, skipping insertion in model container [2024-11-07 05:47:06,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:47:06" (3/3) ... [2024-11-07 05:47:06,175 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i [2024-11-07 05:47:06,189 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:47:06,190 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:47:06,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:47:06,263 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;@6ced5ab2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:47:06,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:47:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 64 states have (on average 1.453125) internal successors, (93), 65 states have internal predecessors, (93), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 05:47:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-07 05:47:06,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:06,285 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:47:06,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:06,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:06,289 INFO L85 PathProgramCache]: Analyzing trace with hash 17050792, now seen corresponding path program 1 times [2024-11-07 05:47:06,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:47:06,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979961540] [2024-11-07 05:47:06,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:06,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:47:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:47:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:47:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:47:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 05:47:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 05:47:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 05:47:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 05:47:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 05:47:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 05:47:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:47:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:47:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 05:47:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 05:47:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:47:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:47:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:47:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:47:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:47:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:47:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:47:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:47:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:47:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:47:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:47:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:47:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:47:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:47:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 05:47:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 05:47:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 05:47:06,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:47:06,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979961540] [2024-11-07 05:47:06,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979961540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:47:06,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:47:06,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:47:06,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082135810] [2024-11-07 05:47:06,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:47:06,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:47:06,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:47:06,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:47:06,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:47:06,851 INFO L87 Difference]: Start difference. First operand has 96 states, 64 states have (on average 1.453125) internal successors, (93), 65 states have internal predecessors, (93), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 05:47:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:47:06,915 INFO L93 Difference]: Finished difference Result 184 states and 323 transitions. [2024-11-07 05:47:06,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:47:06,919 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 192 [2024-11-07 05:47:06,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:47:06,926 INFO L225 Difference]: With dead ends: 184 [2024-11-07 05:47:06,927 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 05:47:06,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:47:06,936 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:47:06,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:47:06,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 05:47:06,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 05:47:06,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 60 states have internal predecessors, (83), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 05:47:06,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 141 transitions. [2024-11-07 05:47:06,980 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 141 transitions. Word has length 192 [2024-11-07 05:47:06,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:47:06,981 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 141 transitions. [2024-11-07 05:47:06,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 05:47:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 141 transitions. [2024-11-07 05:47:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-07 05:47:06,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:06,984 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:47:06,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:47:06,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:06,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:06,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2113628186, now seen corresponding path program 1 times [2024-11-07 05:47:06,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:47:06,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505232065] [2024-11-07 05:47:06,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:06,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:47:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:47:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:47:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:47:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 05:47:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 05:47:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 05:47:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 05:47:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 05:47:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 05:47:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:47:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:47:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 05:47:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 05:47:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:47:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:47:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:47:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:47:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:47:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:47:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:47:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:47:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:47:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:47:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:47:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:47:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:47:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:47:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 05:47:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 05:47:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 05:47:07,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:47:07,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505232065] [2024-11-07 05:47:07,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505232065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:47:07,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:47:07,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:47:07,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977222377] [2024-11-07 05:47:07,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:47:07,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:47:07,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:47:07,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:47:07,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:47:07,363 INFO L87 Difference]: Start difference. First operand 91 states and 141 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:47:07,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:47:07,449 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2024-11-07 05:47:07,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:47:07,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-11-07 05:47:07,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:47:07,469 INFO L225 Difference]: With dead ends: 213 [2024-11-07 05:47:07,469 INFO L226 Difference]: Without dead ends: 125 [2024-11-07 05:47:07,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:47:07,470 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 43 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:47:07,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 258 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:47:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-07 05:47:07,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2024-11-07 05:47:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 05:47:07,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 181 transitions. [2024-11-07 05:47:07,494 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 181 transitions. Word has length 192 [2024-11-07 05:47:07,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:47:07,496 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 181 transitions. [2024-11-07 05:47:07,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:47:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 181 transitions. [2024-11-07 05:47:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-07 05:47:07,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:07,502 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:47:07,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:47:07,503 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:07,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:07,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1421181482, now seen corresponding path program 1 times [2024-11-07 05:47:07,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:47:07,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172665204] [2024-11-07 05:47:07,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:07,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:47:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:47:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:47:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:47:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 05:47:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 05:47:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 05:47:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 05:47:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 05:47:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 05:47:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:47:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:47:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 05:47:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 05:47:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:47:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:47:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:47:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:47:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:47:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:47:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:47:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:47:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:47:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:47:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:47:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:47:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:47:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:47:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 05:47:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 05:47:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 05:47:07,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:47:07,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172665204] [2024-11-07 05:47:07,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172665204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:47:07,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:47:07,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:47:07,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436876774] [2024-11-07 05:47:07,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:47:07,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:47:07,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:47:07,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:47:07,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:47:07,983 INFO L87 Difference]: Start difference. First operand 116 states and 181 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:47:08,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:47:08,035 INFO L93 Difference]: Finished difference Result 324 states and 504 transitions. [2024-11-07 05:47:08,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:47:08,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-11-07 05:47:08,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:47:08,039 INFO L225 Difference]: With dead ends: 324 [2024-11-07 05:47:08,041 INFO L226 Difference]: Without dead ends: 211 [2024-11-07 05:47:08,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:47:08,044 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 76 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:47:08,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 270 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:47:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-07 05:47:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2024-11-07 05:47:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 148 states have (on average 1.3986486486486487) internal successors, (207), 148 states have internal predecessors, (207), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-07 05:47:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 323 transitions. [2024-11-07 05:47:08,088 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 323 transitions. Word has length 192 [2024-11-07 05:47:08,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:47:08,089 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 323 transitions. [2024-11-07 05:47:08,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:47:08,089 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 323 transitions. [2024-11-07 05:47:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-07 05:47:08,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:08,092 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:47:08,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:47:08,095 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:08,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:08,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1562158138, now seen corresponding path program 1 times [2024-11-07 05:47:08,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:47:08,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470213027] [2024-11-07 05:47:08,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:08,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:47:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:47:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:47:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:47:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 05:47:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 05:47:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 05:47:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 05:47:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 05:47:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 05:47:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:47:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:47:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 05:47:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 05:47:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:47:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:47:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:47:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:47:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:47:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:47:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:47:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:47:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:47:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:47:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:47:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:47:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:47:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:47:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 05:47:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 05:47:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 05:47:08,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:47:08,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470213027] [2024-11-07 05:47:08,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470213027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:47:08,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:47:08,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 05:47:08,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111674572] [2024-11-07 05:47:08,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:47:08,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 05:47:08,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:47:08,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 05:47:08,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 05:47:08,667 INFO L87 Difference]: Start difference. First operand 209 states and 323 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:47:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:47:09,025 INFO L93 Difference]: Finished difference Result 594 states and 906 transitions. [2024-11-07 05:47:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 05:47:09,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 193 [2024-11-07 05:47:09,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:47:09,032 INFO L225 Difference]: With dead ends: 594 [2024-11-07 05:47:09,032 INFO L226 Difference]: Without dead ends: 388 [2024-11-07 05:47:09,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:47:09,036 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 141 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:47:09,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 452 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 05:47:09,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-07 05:47:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 308. [2024-11-07 05:47:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 221 states have (on average 1.4027149321266967) internal successors, (310), 223 states have internal predecessors, (310), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-07 05:47:09,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 474 transitions. [2024-11-07 05:47:09,095 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 474 transitions. Word has length 193 [2024-11-07 05:47:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:47:09,095 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 474 transitions. [2024-11-07 05:47:09,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:47:09,096 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 474 transitions. [2024-11-07 05:47:09,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-07 05:47:09,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:09,098 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:47:09,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 05:47:09,098 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:09,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:09,098 INFO L85 PathProgramCache]: Analyzing trace with hash 752811512, now seen corresponding path program 1 times [2024-11-07 05:47:09,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:47:09,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212747855] [2024-11-07 05:47:09,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:09,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:47:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:47:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:47:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:47:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 05:47:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 05:47:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 05:47:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 05:47:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 05:47:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 05:47:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:47:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:47:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 05:47:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 05:47:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:47:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:47:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:47:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:47:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:47:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:47:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:47:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:47:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:47:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:47:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:47:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:47:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:47:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:47:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 05:47:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 05:47:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:09,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 05:47:09,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:47:09,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212747855] [2024-11-07 05:47:09,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212747855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:47:09,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:47:09,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 05:47:09,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193808137] [2024-11-07 05:47:09,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:47:09,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:47:09,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:47:09,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:47:09,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:47:09,694 INFO L87 Difference]: Start difference. First operand 308 states and 474 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:47:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:47:10,380 INFO L93 Difference]: Finished difference Result 990 states and 1521 transitions. [2024-11-07 05:47:10,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:47:10,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 193 [2024-11-07 05:47:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:47:10,387 INFO L225 Difference]: With dead ends: 990 [2024-11-07 05:47:10,387 INFO L226 Difference]: Without dead ends: 685 [2024-11-07 05:47:10,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-07 05:47:10,392 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 189 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 05:47:10,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 629 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 05:47:10,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-11-07 05:47:10,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 413. [2024-11-07 05:47:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 296 states have (on average 1.4087837837837838) internal successors, (417), 298 states have internal predecessors, (417), 111 states have call successors, (111), 5 states have call predecessors, (111), 5 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-07 05:47:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 639 transitions. [2024-11-07 05:47:10,477 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 639 transitions. Word has length 193 [2024-11-07 05:47:10,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:47:10,477 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 639 transitions. [2024-11-07 05:47:10,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:47:10,477 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 639 transitions. [2024-11-07 05:47:10,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-07 05:47:10,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:10,479 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:47:10,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 05:47:10,480 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:10,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:10,480 INFO L85 PathProgramCache]: Analyzing trace with hash -114539666, now seen corresponding path program 1 times [2024-11-07 05:47:10,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:47:10,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494329418] [2024-11-07 05:47:10,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:10,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:47:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:47:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:47:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:47:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 05:47:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 05:47:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 05:47:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 05:47:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 05:47:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 05:47:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:47:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:47:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 05:47:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 05:47:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:47:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:47:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:47:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:47:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:47:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:47:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:47:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:47:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:47:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:47:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:47:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:47:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:47:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:47:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 05:47:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 05:47:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-07 05:47:10,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:47:10,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494329418] [2024-11-07 05:47:10,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494329418] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:47:10,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549421726] [2024-11-07 05:47:10,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:10,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:47:10,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:47:10,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:47:10,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 05:47:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:11,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 05:47:11,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:47:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 378 proven. 9 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2024-11-07 05:47:11,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:47:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-07 05:47:11,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549421726] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:47:11,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 05:47:11,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 05:47:11,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435866270] [2024-11-07 05:47:11,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 05:47:11,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 05:47:11,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:47:11,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 05:47:11,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:47:11,499 INFO L87 Difference]: Start difference. First operand 413 states and 639 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 05:47:11,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:47:11,767 INFO L93 Difference]: Finished difference Result 746 states and 1135 transitions. [2024-11-07 05:47:11,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 05:47:11,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 194 [2024-11-07 05:47:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:47:11,772 INFO L225 Difference]: With dead ends: 746 [2024-11-07 05:47:11,772 INFO L226 Difference]: Without dead ends: 441 [2024-11-07 05:47:11,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 442 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 05:47:11,774 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 135 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:47:11,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 259 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:47:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-07 05:47:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 425. [2024-11-07 05:47:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 305 states have (on average 1.3770491803278688) internal successors, (420), 307 states have internal predecessors, (420), 111 states have call successors, (111), 8 states have call predecessors, (111), 8 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-07 05:47:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 642 transitions. [2024-11-07 05:47:11,836 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 642 transitions. Word has length 194 [2024-11-07 05:47:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:47:11,838 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 642 transitions. [2024-11-07 05:47:11,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 05:47:11,838 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 642 transitions. [2024-11-07 05:47:11,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-07 05:47:11,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:11,841 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:47:11,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 05:47:12,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:47:12,042 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:12,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:12,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1660467696, now seen corresponding path program 1 times [2024-11-07 05:47:12,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:47:12,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816626721] [2024-11-07 05:47:12,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:12,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:47:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:47:12,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [435318655] [2024-11-07 05:47:12,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:12,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:47:12,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:47:12,164 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:47:12,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 05:47:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:47:12,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 05:47:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:47:12,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 05:47:12,568 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 05:47:12,569 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 05:47:12,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 05:47:12,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:47:12,775 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:47:12,927 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 05:47:12,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:47:12 BoogieIcfgContainer [2024-11-07 05:47:12,930 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 05:47:12,931 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 05:47:12,931 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 05:47:12,931 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 05:47:12,934 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:47:06" (3/4) ... [2024-11-07 05:47:12,936 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 05:47:12,937 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 05:47:12,938 INFO L158 Benchmark]: Toolchain (without parser) took 7840.49ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 91.1MB in the beginning and 76.8MB in the end (delta: 14.3MB). Peak memory consumption was 102.2MB. Max. memory is 16.1GB. [2024-11-07 05:47:12,940 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:47:12,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.41ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 75.1MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 05:47:12,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.14ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 70.5MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:47:12,940 INFO L158 Benchmark]: Boogie Preprocessor took 81.07ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 64.4MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 05:47:12,940 INFO L158 Benchmark]: RCFGBuilder took 608.39ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 80.8MB in the end (delta: -16.3MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2024-11-07 05:47:12,941 INFO L158 Benchmark]: TraceAbstraction took 6763.54ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 80.3MB in the beginning and 76.8MB in the end (delta: 3.5MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2024-11-07 05:47:12,941 INFO L158 Benchmark]: Witness Printer took 6.14ms. Allocated memory is still 201.3MB. Free memory was 76.8MB in the beginning and 76.8MB in the end (delta: 48.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 05:47:12,942 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.35ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.41ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 75.1MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.14ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 70.5MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 81.07ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 64.4MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 608.39ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 80.8MB in the end (delta: -16.3MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6763.54ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 80.3MB in the beginning and 76.8MB in the end (delta: 3.5MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. * Witness Printer took 6.14ms. Allocated memory is still 201.3MB. Free memory was 76.8MB in the beginning and 76.8MB in the end (delta: 48.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 200, overapproximation of someBinaryFLOATComparisonOperation at line 193. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] unsigned short int var_1_20 = 8; [L41] unsigned char var_1_22 = 0; [L42] unsigned char var_1_25 = 1; [L43] unsigned char var_1_26 = 1; [L44] unsigned char var_1_28 = 0; [L45] double var_1_29 = 50.2; [L46] signed char var_1_32 = -25; [L47] unsigned char var_1_36 = 0; [L48] unsigned char var_1_37 = 0; [L49] signed short int var_1_38 = -4; [L50] float var_1_40 = 16.2; [L51] float var_1_41 = 10.75; [L52] float var_1_42 = 999.6; [L53] float var_1_43 = 64.5; [L54] signed long int var_1_44 = -2; [L55] signed short int var_1_45 = 2; [L56] unsigned char last_1_var_1_8 = 5; [L57] unsigned short int last_1_var_1_18 = 64; VAL [isInitial=0, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L196] last_1_var_1_8 = var_1_8 [L197] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L207] RET updateLastVariables() [L208] CALL updateVariables() [L147] var_1_2 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L148] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L149] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L149] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L150] var_1_3 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L151] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L152] var_1_4 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L153] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L154] var_1_5 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L155] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L156] var_1_6 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L157] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L158] var_1_7 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_8=5, var_1_9=307/20] [L159] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_8=5, var_1_9=307/20] [L160] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5, var_1_9=307/20] [L160] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5, var_1_9=307/20] [L161] var_1_9 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L162] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L163] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L163] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L164] var_1_10 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L165] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L166] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L166] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L167] var_1_11 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L168] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L169] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L169] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L170] var_1_15 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L171] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L172] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L172] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L173] var_1_16 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L174] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L175] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L175] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L176] var_1_17 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L177] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L178] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L178] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L180] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L181] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L181] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L182] var_1_28 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L183] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L184] CALL assume_abort_if_not(var_1_28 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L184] RET assume_abort_if_not(var_1_28 <= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L185] var_1_37 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L186] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L187] CALL assume_abort_if_not(var_1_37 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L187] RET assume_abort_if_not(var_1_37 <= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L188] var_1_41 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_41 >= -461168.6018427382800e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 4611686.018427382800e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L189] RET assume_abort_if_not((var_1_41 >= -461168.6018427382800e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 4611686.018427382800e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L190] var_1_42 = __VERIFIER_nondet_float() [L191] CALL assume_abort_if_not((var_1_42 >= -461168.6018427382800e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 4611686.018427382800e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L191] RET assume_abort_if_not((var_1_42 >= -461168.6018427382800e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 4611686.018427382800e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L192] var_1_43 = __VERIFIER_nondet_float() [L193] CALL assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L193] RET assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L208] RET updateVariables() [L209] CALL step() [L61] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L62] COND TRUE ((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6) [L63] var_1_1 = (5 + last_1_var_1_8) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L70] unsigned short int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=5] [L71] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L72] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=128] [L80] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=128] [L81] COND FALSE !(-128 > var_1_10) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=128] [L91] signed long int stepLocal_1 = ((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)); VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, stepLocal_1=128, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=128] [L92] COND TRUE var_1_10 == stepLocal_1 [L93] var_1_14 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=128] [L97] COND TRUE \read(var_1_2) [L98] var_1_13 = var_1_11 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=128, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=128] [L100] COND TRUE var_1_8 == var_1_13 [L101] var_1_18 = (var_1_10 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=128, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=128, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=128] [L113] var_1_20 = var_1_11 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=128, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=128, var_1_1=10, var_1_20=128, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=128] [L114] COND TRUE var_1_2 || (2.65f > var_1_3) [L115] var_1_22 = (! (! var_1_25)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=128, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=128, var_1_1=10, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=128] [L117] COND TRUE \read(var_1_2) [L118] var_1_26 = (! ((var_1_9 >= var_1_5) && var_1_28)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=128, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=128, var_1_1=10, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=65536, var_1_8=128] [L120] COND TRUE \read(var_1_2) [L121] var_1_29 = ((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=128, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=128, var_1_1=10, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_4=2, var_1_7=65536, var_1_8=128] [L123] COND TRUE (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) - ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) <= var_1_11 [L124] var_1_32 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=128, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=128, var_1_1=10, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_4=2, var_1_7=65536, var_1_8=128] [L126] EXPR var_1_16 & var_1_15 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=128, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=128, var_1_1=10, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_4=2, var_1_7=65536, var_1_8=128] [L126] COND TRUE (var_1_16 & var_1_15) <= ((var_1_15 - var_1_16) + -16) [L127] var_1_36 = var_1_25 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=128, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=128, var_1_1=10, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=1, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_4=2, var_1_7=65536, var_1_8=128] [L135] EXPR var_1_11 >> var_1_16 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=128, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=128, var_1_1=10, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=1, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_4=2, var_1_7=65536, var_1_8=128] [L135] COND FALSE !(((var_1_11 | 1) % var_1_15) >= (var_1_11 >> var_1_16)) [L138] COND FALSE !(\read(var_1_37)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=128, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=128, var_1_1=10, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=1, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_4=2, var_1_7=65536, var_1_8=128] [L141] COND TRUE \read(var_1_2) [L142] var_1_44 = (-5 + var_1_16) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=128, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=128, var_1_1=10, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=1, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=2, var_1_4=2, var_1_7=65536, var_1_8=128] [L144] var_1_45 = var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=10, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=128, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=128, var_1_1=10, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=1, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=128, var_1_4=2, var_1_7=65536, var_1_8=128] [L209] RET step() [L210] CALL, EXPR property() [L200-L201] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + last_1_var_1_8))) : (var_1_1 == ((unsigned short int) last_1_var_1_8))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (last_1_var_1_18 + var_1_10)))) : (var_1_12 == ((signed long int) last_1_var_1_18))) : 1) : (var_1_12 == ((signed long int) last_1_var_1_18)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_8 == var_1_13) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) : ((last_1_var_1_18 != var_1_16) ? ((-256 >= var_1_13) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=128, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=128, var_1_1=10, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=1, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=128, var_1_4=2, var_1_7=65536, var_1_8=128] [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=128, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=128, var_1_1=10, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=1, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=128, var_1_4=2, var_1_7=65536, var_1_8=128] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=128, var_1_11=-128, var_1_12=32, var_1_13=128, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-1, var_1_18=128, var_1_1=10, var_1_20=128, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=1, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=128, var_1_4=2, var_1_7=65536, var_1_8=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 7, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 608 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 584 mSDsluCounter, 2009 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1177 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 717 IncrementalHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 832 mSDtfsCounter, 717 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 801 GetRequests, 773 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=425occurred in iteration=6, InterpolantAutomatonStates: 31, 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, 6 MinimizatonAttempts, 379 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1738 NumberOfCodeBlocks, 1738 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1536 ConstructedInterpolants, 0 QuantifiedInterpolants, 2771 SizeOfPredicates, 1 NumberOfNonLiveVariables, 450 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 12965/12992 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 05:47:12,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 734c3c8d8fcb1b5f511dd20f78d90b7e50c76be5359a62f6160d8ac75ffd147b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:47:15,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:47:15,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 05:47:15,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:47:15,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:47:15,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:47:15,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:47:15,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:47:15,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:47:15,385 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:47:15,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:47:15,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:47:15,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:47:15,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:47:15,387 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:47:15,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:47:15,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:47:15,388 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:47:15,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:47:15,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:47:15,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:47:15,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:47:15,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:47:15,389 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 05:47:15,389 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 05:47:15,389 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:47:15,389 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 05:47:15,389 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:47:15,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:47:15,389 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:47:15,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:47:15,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:47:15,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:47:15,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:47:15,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:47:15,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:47:15,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:47:15,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:47:15,391 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 05:47:15,391 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 05:47:15,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:47:15,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:47:15,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:47:15,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:47:15,392 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 734c3c8d8fcb1b5f511dd20f78d90b7e50c76be5359a62f6160d8ac75ffd147b [2024-11-07 05:47:15,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:47:15,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:47:15,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:47:15,719 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:47:15,719 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:47:15,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i [2024-11-07 05:47:17,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:47:17,373 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:47:17,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i [2024-11-07 05:47:17,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a004f5af/ec6d173cbb444b9e97e100e6a7823fbb/FLAG5ddec70fe [2024-11-07 05:47:17,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a004f5af/ec6d173cbb444b9e97e100e6a7823fbb [2024-11-07 05:47:17,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:47:17,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:47:17,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:47:17,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:47:17,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:47:17,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:47:17" (1/1) ... [2024-11-07 05:47:17,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6783b3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:17, skipping insertion in model container [2024-11-07 05:47:17,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:47:17" (1/1) ... [2024-11-07 05:47:17,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:47:17,598 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i[919,932] [2024-11-07 05:47:17,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:47:17,696 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:47:17,709 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i[919,932] [2024-11-07 05:47:17,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:47:17,773 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:47:17,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:17 WrapperNode [2024-11-07 05:47:17,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:47:17,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:47:17,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:47:17,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:47:17,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:17" (1/1) ... [2024-11-07 05:47:17,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:17" (1/1) ... [2024-11-07 05:47:17,841 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-11-07 05:47:17,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:47:17,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:47:17,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:47:17,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:47:17,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:17" (1/1) ... [2024-11-07 05:47:17,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:17" (1/1) ... [2024-11-07 05:47:17,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:17" (1/1) ... [2024-11-07 05:47:17,892 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 05:47:17,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:17" (1/1) ... [2024-11-07 05:47:17,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:17" (1/1) ... [2024-11-07 05:47:17,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:17" (1/1) ... [2024-11-07 05:47:17,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:17" (1/1) ... [2024-11-07 05:47:17,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:17" (1/1) ... [2024-11-07 05:47:17,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:17" (1/1) ... [2024-11-07 05:47:17,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:47:17,919 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:47:17,919 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:47:17,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:47:17,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:17" (1/1) ... [2024-11-07 05:47:17,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:47:17,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:47:17,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 05:47:17,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 05:47:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:47:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 05:47:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:47:17,990 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:47:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:47:17,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:47:18,097 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:47:18,099 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:47:42,713 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 05:47:42,713 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:47:42,724 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:47:42,724 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:47:42,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:47:42 BoogieIcfgContainer [2024-11-07 05:47:42,725 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:47:42,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:47:42,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:47:42,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:47:42,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:47:17" (1/3) ... [2024-11-07 05:47:42,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e70616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:47:42, skipping insertion in model container [2024-11-07 05:47:42,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:47:17" (2/3) ... [2024-11-07 05:47:42,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e70616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:47:42, skipping insertion in model container [2024-11-07 05:47:42,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:47:42" (3/3) ... [2024-11-07 05:47:42,734 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-48.i [2024-11-07 05:47:42,746 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:47:42,746 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:47:42,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:47:42,812 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;@69d31fa8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:47:42,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:47:42,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 05:47:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 05:47:42,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:42,830 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:47:42,830 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:42,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:42,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1099054656, now seen corresponding path program 1 times [2024-11-07 05:47:42,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:47:42,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122438446] [2024-11-07 05:47:42,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:42,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:47:42,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:47:42,849 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:47:42,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 05:47:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:44,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 05:47:44,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:47:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [2024-11-07 05:47:44,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:47:44,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:47:44,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122438446] [2024-11-07 05:47:44,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122438446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:47:44,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:47:44,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:47:44,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914644779] [2024-11-07 05:47:44,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:47:44,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:47:44,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:47:44,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:47:44,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:47:44,698 INFO L87 Difference]: Start difference. First operand has 91 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 05:47:44,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:47:44,739 INFO L93 Difference]: Finished difference Result 174 states and 307 transitions. [2024-11-07 05:47:44,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:47:44,741 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 190 [2024-11-07 05:47:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:47:44,748 INFO L225 Difference]: With dead ends: 174 [2024-11-07 05:47:44,750 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 05:47:44,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:47:44,759 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:47:44,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:47:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 05:47:44,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-07 05:47:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 05:47:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2024-11-07 05:47:44,806 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 190 [2024-11-07 05:47:44,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:47:44,806 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2024-11-07 05:47:44,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 05:47:44,807 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2024-11-07 05:47:44,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 05:47:44,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:44,811 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:47:44,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 05:47:45,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:47:45,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:45,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:45,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1972743730, now seen corresponding path program 1 times [2024-11-07 05:47:45,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:47:45,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115694486] [2024-11-07 05:47:45,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:45,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:47:45,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:47:45,017 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:47:45,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 05:47:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:46,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 05:47:46,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:47:47,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 05:47:47,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:47:47,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:47:47,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115694486] [2024-11-07 05:47:47,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115694486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:47:47,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:47:47,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:47:47,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919364720] [2024-11-07 05:47:47,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:47:47,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:47:47,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:47:47,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:47:47,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:47:47,167 INFO L87 Difference]: Start difference. First operand 86 states and 133 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:47:52,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.49s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:47:56,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:47:56,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:47:56,370 INFO L93 Difference]: Finished difference Result 198 states and 309 transitions. [2024-11-07 05:47:56,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:47:56,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-11-07 05:47:56,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:47:56,375 INFO L225 Difference]: With dead ends: 198 [2024-11-07 05:47:56,375 INFO L226 Difference]: Without dead ends: 115 [2024-11-07 05:47:56,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:47:56,377 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 32 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:47:56,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 242 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2024-11-07 05:47:56,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-07 05:47:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2024-11-07 05:47:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 75 states have internal predecessors, (107), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 05:47:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 165 transitions. [2024-11-07 05:47:56,390 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 165 transitions. Word has length 190 [2024-11-07 05:47:56,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:47:56,392 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 165 transitions. [2024-11-07 05:47:56,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:47:56,392 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 165 transitions. [2024-11-07 05:47:56,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 05:47:56,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:56,395 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:47:56,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 05:47:56,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:47:56,596 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:56,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:56,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1968163694, now seen corresponding path program 1 times [2024-11-07 05:47:56,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:47:56,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779481168] [2024-11-07 05:47:56,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:56,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:47:56,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:47:56,600 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:47:56,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 05:47:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:58,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 05:47:58,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:48:05,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 05:48:05,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:48:05,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:48:05,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779481168] [2024-11-07 05:48:05,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779481168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:05,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:05,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:48:05,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762461161] [2024-11-07 05:48:05,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:05,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:48:05,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:48:05,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:48:05,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:05,730 INFO L87 Difference]: Start difference. First operand 106 states and 165 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:48:10,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:48:14,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:48:14,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:14,360 INFO L93 Difference]: Finished difference Result 299 states and 464 transitions. [2024-11-07 05:48:14,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:48:14,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-11-07 05:48:14,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:14,538 INFO L225 Difference]: With dead ends: 299 [2024-11-07 05:48:14,538 INFO L226 Difference]: Without dead ends: 196 [2024-11-07 05:48:14,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:14,539 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 36 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:14,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 255 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2024-11-07 05:48:14,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-07 05:48:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2024-11-07 05:48:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-07 05:48:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 299 transitions. [2024-11-07 05:48:14,570 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 299 transitions. Word has length 190 [2024-11-07 05:48:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:14,570 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 299 transitions. [2024-11-07 05:48:14,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 05:48:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 299 transitions. [2024-11-07 05:48:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 05:48:14,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:14,573 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:14,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 05:48:14,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:48:14,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:14,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:14,775 INFO L85 PathProgramCache]: Analyzing trace with hash 490250856, now seen corresponding path program 1 times [2024-11-07 05:48:14,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:48:14,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432825344] [2024-11-07 05:48:14,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:14,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:48:14,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:48:14,779 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:48:14,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 05:48:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:16,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 05:48:16,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:48:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 378 proven. 9 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2024-11-07 05:48:18,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:48:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-07 05:48:23,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:48:23,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432825344] [2024-11-07 05:48:23,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432825344] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:48:23,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:48:23,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-07 05:48:23,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036255284] [2024-11-07 05:48:23,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:48:23,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 05:48:23,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:48:23,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 05:48:23,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:48:23,157 INFO L87 Difference]: Start difference. First operand 194 states and 299 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 05:48:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:27,429 INFO L93 Difference]: Finished difference Result 401 states and 609 transitions. [2024-11-07 05:48:27,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 05:48:27,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 191 [2024-11-07 05:48:27,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:27,434 INFO L225 Difference]: With dead ends: 401 [2024-11-07 05:48:27,434 INFO L226 Difference]: Without dead ends: 210 [2024-11-07 05:48:27,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 05:48:27,438 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 174 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:27,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 234 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-07 05:48:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-07 05:48:27,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 202. [2024-11-07 05:48:27,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 139 states have internal predecessors, (186), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-07 05:48:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 302 transitions. [2024-11-07 05:48:27,482 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 302 transitions. Word has length 191 [2024-11-07 05:48:27,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:27,484 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 302 transitions. [2024-11-07 05:48:27,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 05:48:27,484 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 302 transitions. [2024-11-07 05:48:27,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 05:48:27,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:27,488 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:27,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 05:48:27,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:48:27,689 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:27,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:27,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2029709078, now seen corresponding path program 1 times [2024-11-07 05:48:27,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:48:27,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059596436] [2024-11-07 05:48:27,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:27,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:48:27,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:48:27,694 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:48:27,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 05:48:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:29,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 05:48:29,340 INFO L278 TraceCheckSpWp]: Computing forward predicates...