./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-51.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_fillercodesize_ps-cn-10_file-51.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', '31ebc7aab32916bad3f1682a2356b41139150eb4d3e5667a296140fbcfedcac2'] 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_fillercodesize_ps-cn-10_file-51.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 31ebc7aab32916bad3f1682a2356b41139150eb4d3e5667a296140fbcfedcac2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:56:06,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:56:06,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:56:06,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:56:06,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:56:07,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:56:07,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:56:07,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:56:07,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:56:07,015 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:56:07,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:56:07,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:56:07,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:56:07,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:56:07,016 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:56:07,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:56:07,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:56:07,016 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:56:07,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:56:07,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:56:07,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:56:07,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:56:07,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:56:07,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:56:07,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:56:07,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:56:07,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:56:07,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:56:07,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:56:07,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:56:07,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:56:07,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:56:07,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:56:07,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:56:07,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:56:07,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:56:07,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:56:07,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:56:07,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:56:07,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:56:07,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:56:07,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:56:07,018 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 -> 31ebc7aab32916bad3f1682a2356b41139150eb4d3e5667a296140fbcfedcac2 [2024-11-07 04:56:07,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:56:07,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:56:07,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:56:07,242 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:56:07,242 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:56:07,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-51.i [2024-11-07 04:56:08,342 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:56:08,550 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:56:08,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-51.i [2024-11-07 04:56:08,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f9afcb0d/1a569c50a100464b8d652fea6cb76422/FLAG06a9acc5b [2024-11-07 04:56:08,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f9afcb0d/1a569c50a100464b8d652fea6cb76422 [2024-11-07 04:56:08,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:56:08,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:56:08,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:56:08,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:56:08,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:56:08,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:56:08" (1/1) ... [2024-11-07 04:56:08,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a80393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:08, skipping insertion in model container [2024-11-07 04:56:08,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:56:08" (1/1) ... [2024-11-07 04:56:08,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:56:08,704 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_fillercodesize_ps-cn-10_file-51.i[915,928] [2024-11-07 04:56:08,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:56:08,756 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:56:08,766 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_fillercodesize_ps-cn-10_file-51.i[915,928] [2024-11-07 04:56:08,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:56:08,802 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:56:08,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:08 WrapperNode [2024-11-07 04:56:08,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:56:08,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:56:08,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:56:08,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:56:08,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:08" (1/1) ... [2024-11-07 04:56:08,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:08" (1/1) ... [2024-11-07 04:56:08,850 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-07 04:56:08,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:56:08,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:56:08,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:56:08,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:56:08,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:08" (1/1) ... [2024-11-07 04:56:08,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:08" (1/1) ... [2024-11-07 04:56:08,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:08" (1/1) ... [2024-11-07 04:56:08,878 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 04:56:08,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:08" (1/1) ... [2024-11-07 04:56:08,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:08" (1/1) ... [2024-11-07 04:56:08,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:08" (1/1) ... [2024-11-07 04:56:08,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:08" (1/1) ... [2024-11-07 04:56:08,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:08" (1/1) ... [2024-11-07 04:56:08,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:08" (1/1) ... [2024-11-07 04:56:08,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:56:08,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:56:08,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:56:08,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:56:08,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:08" (1/1) ... [2024-11-07 04:56:08,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:56:08,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:56:08,937 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 04:56:08,939 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 04:56:08,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:56:08,956 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:56:08,957 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:56:08,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:56:08,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:56:08,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:56:09,017 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:56:09,018 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:56:09,245 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 04:56:09,246 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:56:09,252 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:56:09,252 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:56:09,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:56:09 BoogieIcfgContainer [2024-11-07 04:56:09,253 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:56:09,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:56:09,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:56:09,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:56:09,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:56:08" (1/3) ... [2024-11-07 04:56:09,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7e1b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:56:09, skipping insertion in model container [2024-11-07 04:56:09,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:08" (2/3) ... [2024-11-07 04:56:09,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7e1b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:56:09, skipping insertion in model container [2024-11-07 04:56:09,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:56:09" (3/3) ... [2024-11-07 04:56:09,259 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-51.i [2024-11-07 04:56:09,268 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:56:09,268 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:56:09,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:56:09,335 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;@6c27d0e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:56:09,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:56:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 53 states have internal predecessors, (71), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 04:56:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 04:56:09,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:56:09,346 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:09,347 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:56:09,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:56:09,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1762583813, now seen corresponding path program 1 times [2024-11-07 04:56:09,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:56:09,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568363157] [2024-11-07 04:56:09,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:09,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:56:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:56:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:56:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 04:56:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:56:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:56:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:56:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 04:56:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:56:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 04:56:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:56:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:56:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:56:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:56:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:56:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:56:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:56:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 04:56:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:56:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 04:56:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:56:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 04:56:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 04:56:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 04:56:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 04:56:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 04:56:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 04:56:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 04:56:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 04:56:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 04:56:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 04:56:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 04:56:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:56:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 04:56:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 04:56:09,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:56:09,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568363157] [2024-11-07 04:56:09,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568363157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:56:09,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:56:09,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:56:09,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346601029] [2024-11-07 04:56:09,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:56:09,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:56:09,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:56:09,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:56:09,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:56:09,674 INFO L87 Difference]: Start difference. First operand has 88 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 53 states have internal predecessors, (71), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 04:56:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:56:09,694 INFO L93 Difference]: Finished difference Result 169 states and 301 transitions. [2024-11-07 04:56:09,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:56:09,695 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 203 [2024-11-07 04:56:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:56:09,699 INFO L225 Difference]: With dead ends: 169 [2024-11-07 04:56:09,700 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 04:56:09,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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 04:56:09,707 INFO L432 NwaCegarLoop]: 130 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, 130 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 04:56:09,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:56:09,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 04:56:09,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-07 04:56:09,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 04:56:09,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 130 transitions. [2024-11-07 04:56:09,736 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 130 transitions. Word has length 203 [2024-11-07 04:56:09,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:56:09,736 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 130 transitions. [2024-11-07 04:56:09,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 04:56:09,736 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 130 transitions. [2024-11-07 04:56:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 04:56:09,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:56:09,741 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:09,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:56:09,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:56:09,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:56:09,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1964910719, now seen corresponding path program 1 times [2024-11-07 04:56:09,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:56:09,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449017522] [2024-11-07 04:56:09,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:09,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:56:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:56:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:56:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 04:56:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:56:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:56:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:56:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 04:56:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:56:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 04:56:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:56:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:56:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:56:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:56:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:56:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:56:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:56:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 04:56:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:56:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 04:56:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:56:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 04:56:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 04:56:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 04:56:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 04:56:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 04:56:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 04:56:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 04:56:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 04:56:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 04:56:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 04:56:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 04:56:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:56:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 04:56:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 04:56:10,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:56:10,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449017522] [2024-11-07 04:56:10,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449017522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:56:10,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:56:10,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:56:10,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145133861] [2024-11-07 04:56:10,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:56:10,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:56:10,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:56:10,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:56:10,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:56:10,355 INFO L87 Difference]: Start difference. First operand 84 states and 130 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 04:56:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:56:10,530 INFO L93 Difference]: Finished difference Result 247 states and 385 transitions. [2024-11-07 04:56:10,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:56:10,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 203 [2024-11-07 04:56:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:56:10,533 INFO L225 Difference]: With dead ends: 247 [2024-11-07 04:56:10,533 INFO L226 Difference]: Without dead ends: 166 [2024-11-07 04:56:10,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:56:10,535 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 85 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:56:10,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 366 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:56:10,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-07 04:56:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 145. [2024-11-07 04:56:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 04:56:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 225 transitions. [2024-11-07 04:56:10,572 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 225 transitions. Word has length 203 [2024-11-07 04:56:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:56:10,572 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 225 transitions. [2024-11-07 04:56:10,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 04:56:10,573 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 225 transitions. [2024-11-07 04:56:10,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 04:56:10,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:56:10,576 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:10,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:56:10,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:56:10,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:56:10,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1671135613, now seen corresponding path program 1 times [2024-11-07 04:56:10,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:56:10,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21557705] [2024-11-07 04:56:10,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:10,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:56:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:56:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:56:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 04:56:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:56:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:56:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:56:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 04:56:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:56:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 04:56:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:56:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:56:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:56:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:56:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:56:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:56:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:56:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 04:56:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:56:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 04:56:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:56:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:10,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 04:56:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 04:56:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 04:56:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 04:56:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 04:56:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 04:56:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 04:56:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 04:56:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 04:56:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 04:56:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 04:56:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:56:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 04:56:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 04:56:11,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:56:11,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21557705] [2024-11-07 04:56:11,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21557705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:56:11,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:56:11,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 04:56:11,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666380721] [2024-11-07 04:56:11,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:56:11,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 04:56:11,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:56:11,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 04:56:11,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:56:11,056 INFO L87 Difference]: Start difference. First operand 145 states and 225 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 04:56:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:56:11,269 INFO L93 Difference]: Finished difference Result 314 states and 486 transitions. [2024-11-07 04:56:11,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 04:56:11,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2024-11-07 04:56:11,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:56:11,271 INFO L225 Difference]: With dead ends: 314 [2024-11-07 04:56:11,271 INFO L226 Difference]: Without dead ends: 233 [2024-11-07 04:56:11,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:56:11,272 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 96 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:56:11,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 434 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 04:56:11,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-07 04:56:11,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 224. [2024-11-07 04:56:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 121 states have (on average 1.256198347107438) internal successors, (152), 121 states have internal predecessors, (152), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-07 04:56:11,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 350 transitions. [2024-11-07 04:56:11,311 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 350 transitions. Word has length 204 [2024-11-07 04:56:11,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:56:11,311 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 350 transitions. [2024-11-07 04:56:11,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 04:56:11,311 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 350 transitions. [2024-11-07 04:56:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-07 04:56:11,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:56:11,313 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:11,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:56:11,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:56:11,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:56:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash 833854104, now seen corresponding path program 1 times [2024-11-07 04:56:11,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:56:11,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381291540] [2024-11-07 04:56:11,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:11,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:56:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:56:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:56:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 04:56:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:56:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:56:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:56:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 04:56:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:56:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 04:56:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:56:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:56:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:56:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:56:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:56:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:56:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:56:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 04:56:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:56:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 04:56:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:56:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 04:56:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 04:56:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 04:56:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 04:56:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 04:56:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 04:56:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 04:56:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 04:56:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 04:56:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 04:56:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 04:56:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:56:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 04:56:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 04:56:11,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:56:11,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381291540] [2024-11-07 04:56:11,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381291540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:56:11,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:56:11,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:56:11,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654023207] [2024-11-07 04:56:11,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:56:11,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:56:11,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:56:11,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:56:11,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:56:11,612 INFO L87 Difference]: Start difference. First operand 224 states and 350 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 04:56:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:56:11,808 INFO L93 Difference]: Finished difference Result 544 states and 854 transitions. [2024-11-07 04:56:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:56:11,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 205 [2024-11-07 04:56:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:56:11,815 INFO L225 Difference]: With dead ends: 544 [2024-11-07 04:56:11,815 INFO L226 Difference]: Without dead ends: 384 [2024-11-07 04:56:11,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:56:11,816 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 91 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:56:11,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 349 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:56:11,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-07 04:56:11,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 382. [2024-11-07 04:56:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 211 states have (on average 1.2748815165876777) internal successors, (269), 211 states have internal predecessors, (269), 165 states have call successors, (165), 5 states have call predecessors, (165), 5 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2024-11-07 04:56:11,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 599 transitions. [2024-11-07 04:56:11,889 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 599 transitions. Word has length 205 [2024-11-07 04:56:11,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:56:11,889 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 599 transitions. [2024-11-07 04:56:11,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 04:56:11,889 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 599 transitions. [2024-11-07 04:56:11,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-07 04:56:11,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:56:11,891 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:11,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 04:56:11,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:56:11,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:56:11,891 INFO L85 PathProgramCache]: Analyzing trace with hash 440827094, now seen corresponding path program 1 times [2024-11-07 04:56:11,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:56:11,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477562646] [2024-11-07 04:56:11,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:11,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:56:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:56:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:56:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 04:56:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:56:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:56:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:56:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 04:56:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:56:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 04:56:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:56:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:56:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:56:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:56:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:56:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:56:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:56:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 04:56:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:56:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 04:56:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:56:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 04:56:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 04:56:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 04:56:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 04:56:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 04:56:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 04:56:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 04:56:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 04:56:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 04:56:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 04:56:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 04:56:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:56:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 04:56:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 04:56:12,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:56:12,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477562646] [2024-11-07 04:56:12,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477562646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:56:12,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:56:12,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:56:12,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576758642] [2024-11-07 04:56:12,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:56:12,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:56:12,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:56:12,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:56:12,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:56:12,098 INFO L87 Difference]: Start difference. First operand 382 states and 599 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 04:56:12,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:56:12,143 INFO L93 Difference]: Finished difference Result 710 states and 1117 transitions. [2024-11-07 04:56:12,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:56:12,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2024-11-07 04:56:12,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:56:12,147 INFO L225 Difference]: With dead ends: 710 [2024-11-07 04:56:12,147 INFO L226 Difference]: Without dead ends: 392 [2024-11-07 04:56:12,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 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 04:56:12,148 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 17 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:56:12,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 263 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:56:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-07 04:56:12,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 382. [2024-11-07 04:56:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 211 states have (on average 1.2559241706161137) internal successors, (265), 211 states have internal predecessors, (265), 165 states have call successors, (165), 5 states have call predecessors, (165), 5 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2024-11-07 04:56:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 595 transitions. [2024-11-07 04:56:12,225 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 595 transitions. Word has length 205 [2024-11-07 04:56:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:56:12,226 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 595 transitions. [2024-11-07 04:56:12,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 04:56:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 595 transitions. [2024-11-07 04:56:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 04:56:12,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:56:12,228 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:12,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 04:56:12,228 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:56:12,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:56:12,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1817249618, now seen corresponding path program 1 times [2024-11-07 04:56:12,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:56:12,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476829953] [2024-11-07 04:56:12,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:12,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:56:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:56:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:56:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 04:56:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:56:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:56:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:56:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 04:56:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:56:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 04:56:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:56:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:56:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:56:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:56:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:56:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:56:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:56:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 04:56:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:56:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 04:56:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:56:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 04:56:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 04:56:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 04:56:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 04:56:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 04:56:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 04:56:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 04:56:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 04:56:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 04:56:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 04:56:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 04:56:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:56:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 04:56:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-07 04:56:12,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:56:12,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476829953] [2024-11-07 04:56:12,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476829953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:56:12,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949979618] [2024-11-07 04:56:12,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:12,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:56:12,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:56:12,480 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 04:56:12,481 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 04:56:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:12,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 04:56:12,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:56:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 816 proven. 72 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2024-11-07 04:56:12,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:56:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-07 04:56:13,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949979618] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 04:56:13,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 04:56:13,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-07 04:56:13,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131908878] [2024-11-07 04:56:13,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 04:56:13,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 04:56:13,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:56:13,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 04:56:13,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 04:56:13,018 INFO L87 Difference]: Start difference. First operand 382 states and 595 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (81), 2 states have call predecessors, (81), 4 states have return successors, (82), 3 states have call predecessors, (82), 3 states have call successors, (82) [2024-11-07 04:56:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:56:13,233 INFO L93 Difference]: Finished difference Result 572 states and 870 transitions. [2024-11-07 04:56:13,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 04:56:13,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (81), 2 states have call predecessors, (81), 4 states have return successors, (82), 3 states have call predecessors, (82), 3 states have call successors, (82) Word has length 206 [2024-11-07 04:56:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:56:13,237 INFO L225 Difference]: With dead ends: 572 [2024-11-07 04:56:13,237 INFO L226 Difference]: Without dead ends: 412 [2024-11-07 04:56:13,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-07 04:56:13,242 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 45 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:56:13,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 197 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 04:56:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-07 04:56:13,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 236. [2024-11-07 04:56:13,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 130 states have (on average 1.2076923076923076) internal successors, (157), 130 states have internal predecessors, (157), 99 states have call successors, (99), 6 states have call predecessors, (99), 6 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-07 04:56:13,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 355 transitions. [2024-11-07 04:56:13,283 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 355 transitions. Word has length 206 [2024-11-07 04:56:13,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:56:13,284 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 355 transitions. [2024-11-07 04:56:13,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (81), 2 states have call predecessors, (81), 4 states have return successors, (82), 3 states have call predecessors, (82), 3 states have call successors, (82) [2024-11-07 04:56:13,284 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 355 transitions. [2024-11-07 04:56:13,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 04:56:13,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:56:13,285 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:13,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 04:56:13,489 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 04:56:13,490 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:56:13,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:56:13,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1424222608, now seen corresponding path program 1 times [2024-11-07 04:56:13,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:56:13,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969486090] [2024-11-07 04:56:13,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:13,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:56:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:56:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:56:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 04:56:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:56:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:56:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:56:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 04:56:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:56:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 04:56:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:56:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:56:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:56:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:56:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:56:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:56:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:56:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 04:56:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:56:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 04:56:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:56:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 04:56:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 04:56:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 04:56:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 04:56:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 04:56:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 04:56:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 04:56:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 04:56:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 04:56:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 04:56:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 04:56:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:56:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 04:56:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 54 proven. 42 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-07 04:56:13,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:56:13,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969486090] [2024-11-07 04:56:13,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969486090] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:56:13,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435847946] [2024-11-07 04:56:13,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:13,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:56:13,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:56:13,777 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 04:56:13,778 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 04:56:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:13,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 04:56:13,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:56:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1076 proven. 42 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2024-11-07 04:56:14,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:56:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 54 proven. 42 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-07 04:56:14,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435847946] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 04:56:14,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 04:56:14,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2024-11-07 04:56:14,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855723452] [2024-11-07 04:56:14,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 04:56:14,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 04:56:14,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:56:14,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 04:56:14,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-07 04:56:14,302 INFO L87 Difference]: Start difference. First operand 236 states and 355 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-07 04:56:15,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:56:15,014 INFO L93 Difference]: Finished difference Result 540 states and 780 transitions. [2024-11-07 04:56:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 04:56:15,015 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 206 [2024-11-07 04:56:15,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:56:15,017 INFO L225 Difference]: With dead ends: 540 [2024-11-07 04:56:15,017 INFO L226 Difference]: Without dead ends: 455 [2024-11-07 04:56:15,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 474 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2024-11-07 04:56:15,020 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 196 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 04:56:15,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 620 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 04:56:15,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-07 04:56:15,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 334. [2024-11-07 04:56:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 187 states have (on average 1.1550802139037433) internal successors, (216), 189 states have internal predecessors, (216), 133 states have call successors, (133), 13 states have call predecessors, (133), 13 states have return successors, (133), 131 states have call predecessors, (133), 133 states have call successors, (133) [2024-11-07 04:56:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 482 transitions. [2024-11-07 04:56:15,064 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 482 transitions. Word has length 206 [2024-11-07 04:56:15,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:56:15,064 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 482 transitions. [2024-11-07 04:56:15,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-07 04:56:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 482 transitions. [2024-11-07 04:56:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 04:56:15,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:56:15,066 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:15,079 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 04:56:15,266 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 04:56:15,266 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:56:15,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:56:15,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1256576783, now seen corresponding path program 1 times [2024-11-07 04:56:15,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:56:15,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283014789] [2024-11-07 04:56:15,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:15,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:56:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 04:56:15,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [991851573] [2024-11-07 04:56:15,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:15,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:56:15,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:56:15,336 INFO L229 MonitoredProcess]: Starting monitored process 4 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 04:56:15,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 04:56:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:56:15,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 04:56:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:56:15,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 04:56:15,602 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 04:56:15,602 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 04:56:15,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 04:56:15,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:56:15,806 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:56:15,903 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 04:56:15,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:56:15 BoogieIcfgContainer [2024-11-07 04:56:15,906 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 04:56:15,907 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 04:56:15,907 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 04:56:15,909 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 04:56:15,909 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:56:09" (3/4) ... [2024-11-07 04:56:15,911 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 04:56:15,911 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 04:56:15,912 INFO L158 Benchmark]: Toolchain (without parser) took 7332.83ms. Allocated memory was 109.1MB in the beginning and 201.3MB in the end (delta: 92.3MB). Free memory was 84.7MB in the beginning and 143.2MB in the end (delta: -58.4MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2024-11-07 04:56:15,912 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:56:15,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.68ms. Allocated memory is still 109.1MB. Free memory was 84.6MB in the beginning and 70.1MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:56:15,912 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.47ms. Allocated memory is still 109.1MB. Free memory was 70.0MB in the beginning and 67.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:56:15,912 INFO L158 Benchmark]: Boogie Preprocessor took 56.68ms. Allocated memory is still 109.1MB. Free memory was 67.3MB in the beginning and 64.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:56:15,913 INFO L158 Benchmark]: RCFGBuilder took 344.51ms. Allocated memory is still 109.1MB. Free memory was 64.2MB in the beginning and 42.9MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 04:56:15,913 INFO L158 Benchmark]: TraceAbstraction took 6652.45ms. Allocated memory was 109.1MB in the beginning and 201.3MB in the end (delta: 92.3MB). Free memory was 42.2MB in the beginning and 143.2MB in the end (delta: -101.0MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. [2024-11-07 04:56:15,913 INFO L158 Benchmark]: Witness Printer took 4.46ms. Allocated memory is still 201.3MB. Free memory was 143.2MB in the beginning and 143.2MB in the end (delta: 48.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 04:56:15,914 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.21ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.68ms. Allocated memory is still 109.1MB. Free memory was 84.6MB in the beginning and 70.1MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.47ms. Allocated memory is still 109.1MB. Free memory was 70.0MB in the beginning and 67.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.68ms. Allocated memory is still 109.1MB. Free memory was 67.3MB in the beginning and 64.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 344.51ms. Allocated memory is still 109.1MB. Free memory was 64.2MB in the beginning and 42.9MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6652.45ms. Allocated memory was 109.1MB in the beginning and 201.3MB in the end (delta: 92.3MB). Free memory was 42.2MB in the beginning and 143.2MB in the end (delta: -101.0MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. * Witness Printer took 4.46ms. Allocated memory is still 201.3MB. Free memory was 143.2MB in the beginning and 143.2MB in the end (delta: 48.8kB). 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 181, overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] float var_1_25 = -0.575; [L41] float var_1_26 = 1.5; [L42] unsigned long int var_1_27 = 64; [L43] unsigned long int var_1_28 = 2; [L44] unsigned long int var_1_29 = 25; [L45] signed long int var_1_30 = 128; [L46] signed long int var_1_31 = -5; [L47] unsigned char var_1_32 = 1; [L48] unsigned char var_1_33 = 64; [L49] signed char var_1_34 = -8; [L50] signed long int var_1_35 = 5; [L51] signed char var_1_36 = 10; [L52] unsigned char last_1_var_1_1 = 128; [L53] unsigned long int last_1_var_1_12 = 8; [L54] double last_1_var_1_17 = 256.8; [L55] unsigned char last_1_var_1_21 = 1; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L185] isInitial = 1 [L186] FCALL initially() [L187] COND TRUE 1 [L188] CALL updateLastVariables() [L175] last_1_var_1_1 = var_1_1 [L176] last_1_var_1_12 = var_1_12 [L177] last_1_var_1_17 = var_1_17 [L178] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L188] RET updateLastVariables() [L189] CALL updateVariables() [L122] var_1_4 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L123] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L124] var_1_5 = __VERIFIER_nondet_double() [L125] 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_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=2, var_1_8=-10, var_1_9=5] [L125] 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_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=2, var_1_8=-10, var_1_9=5] [L126] var_1_7 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_8=-10, var_1_9=5] [L127] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_8=-10, var_1_9=5] [L128] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=5] [L128] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=5] [L129] var_1_9 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L130] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L131] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L131] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L132] var_1_10 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L133] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L134] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L134] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L135] var_1_11 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L136] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L137] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L137] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L138] var_1_13 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L139] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L140] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L141] var_1_15 = __VERIFIER_nondet_ulong() [L142] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L142] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L143] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L143] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L144] var_1_18 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L145] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L146] var_1_22 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L147] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L148] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L149] var_1_23 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L150] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L151] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L152] var_1_24 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L153] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L154] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L155] var_1_26 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L156] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L157] var_1_28 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L158] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_28 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L159] RET assume_abort_if_not(var_1_28 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L160] var_1_31 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_31 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L161] RET assume_abort_if_not(var_1_31 >= -2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L162] CALL assume_abort_if_not(var_1_31 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L162] RET assume_abort_if_not(var_1_31 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L163] var_1_33 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L164] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L165] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L165] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L166] var_1_35 = __VERIFIER_nondet_long() [L167] CALL assume_abort_if_not(var_1_35 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L167] RET assume_abort_if_not(var_1_35 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_35 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L168] RET assume_abort_if_not(var_1_35 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L169] CALL assume_abort_if_not(var_1_35 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L169] RET assume_abort_if_not(var_1_35 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L170] var_1_36 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_36 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L171] RET assume_abort_if_not(var_1_36 >= -127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_36 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L172] RET assume_abort_if_not(var_1_36 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L189] RET updateVariables() [L190] CALL step() [L59] var_1_25 = var_1_26 [L60] var_1_27 = var_1_28 [L61] var_1_29 = var_1_28 [L62] var_1_30 = var_1_31 [L63] var_1_32 = var_1_33 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L64] COND FALSE !(var_1_30 < (var_1_31 % var_1_35)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L69] unsigned char stepLocal_3 = ((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L70] COND TRUE last_1_var_1_21 || stepLocal_3 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L71] COND TRUE var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17))) [L72] var_1_19 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L79] unsigned long int stepLocal_1 = last_1_var_1_12; [L80] unsigned long int stepLocal_0 = 32u; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L81] COND TRUE stepLocal_0 >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_1=8, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L82] COND TRUE stepLocal_1 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L83] COND TRUE (var_1_4 - var_1_5) >= last_1_var_1_17 [L84] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L90] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L93] COND TRUE ! (var_1_17 > var_1_5) [L94] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=0, var_1_9=0] [L98] unsigned long int stepLocal_4 = var_1_19; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=0, var_1_9=0] [L99] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L110] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=0, var_1_9=0] [L112] unsigned char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_2=0, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=0, var_1_9=0] [L113] COND FALSE !(var_1_21 && stepLocal_2) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=0, var_1_9=0] [L116] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=0, var_1_9=0] [L190] RET step() [L191] CALL, EXPR property() [L181-L182] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=0, var_1_9=0] [L191] RET, EXPR property() [L191] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 8, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 557 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 530 mSDsluCounter, 2359 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1461 mSDsCounter, 444 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1085 IncrementalHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 444 mSolverCounterUnsat, 898 mSDtfsCounter, 1085 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1372 GetRequests, 1325 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=4, InterpolantAutomatonStates: 47, 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, 7 MinimizatonAttempts, 339 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2258 NumberOfCodeBlocks, 2258 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2245 ConstructedInterpolants, 0 QuantifiedInterpolants, 5099 SizeOfPredicates, 5 NumberOfNonLiveVariables, 948 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 22890/23232 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 04:56:15,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercodesize_ps-cn-10_file-51.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 31ebc7aab32916bad3f1682a2356b41139150eb4d3e5667a296140fbcfedcac2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:56:17,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:56:17,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 04:56:17,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:56:17,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:56:17,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:56:17,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:56:17,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:56:17,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:56:17,799 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:56:17,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:56:17,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:56:17,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:56:17,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:56:17,799 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:56:17,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:56:17,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:56:17,799 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:56:17,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:56:17,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:56:17,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:56:17,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:56:17,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:56:17,800 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 04:56:17,800 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 04:56:17,800 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:56:17,800 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 04:56:17,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:56:17,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:56:17,800 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:56:17,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:56:17,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:56:17,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:56:17,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:56:17,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:56:17,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:56:17,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:56:17,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:56:17,801 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 04:56:17,801 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 04:56:17,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:56:17,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:56:17,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:56:17,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:56:17,801 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 -> 31ebc7aab32916bad3f1682a2356b41139150eb4d3e5667a296140fbcfedcac2 [2024-11-07 04:56:18,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:56:18,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:56:18,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:56:18,021 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:56:18,022 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:56:18,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-51.i [2024-11-07 04:56:19,115 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:56:19,311 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:56:19,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-51.i [2024-11-07 04:56:19,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4738c3f9f/a6a083f5717544efbc1e5cbe7b67951a/FLAG8934856f7 [2024-11-07 04:56:19,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4738c3f9f/a6a083f5717544efbc1e5cbe7b67951a [2024-11-07 04:56:19,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:56:19,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:56:19,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:56:19,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:56:19,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:56:19,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:56:19" (1/1) ... [2024-11-07 04:56:19,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bef0a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:19, skipping insertion in model container [2024-11-07 04:56:19,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:56:19" (1/1) ... [2024-11-07 04:56:19,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:56:19,803 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_fillercodesize_ps-cn-10_file-51.i[915,928] [2024-11-07 04:56:19,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:56:19,853 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:56:19,859 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_fillercodesize_ps-cn-10_file-51.i[915,928] [2024-11-07 04:56:19,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:56:19,889 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:56:19,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:19 WrapperNode [2024-11-07 04:56:19,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:56:19,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:56:19,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:56:19,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:56:19,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:19" (1/1) ... [2024-11-07 04:56:19,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:19" (1/1) ... [2024-11-07 04:56:19,922 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-11-07 04:56:19,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:56:19,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:56:19,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:56:19,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:56:19,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:19" (1/1) ... [2024-11-07 04:56:19,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:19" (1/1) ... [2024-11-07 04:56:19,940 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:19" (1/1) ... [2024-11-07 04:56:19,953 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 04:56:19,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:19" (1/1) ... [2024-11-07 04:56:19,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:19" (1/1) ... [2024-11-07 04:56:19,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:19" (1/1) ... [2024-11-07 04:56:19,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:19" (1/1) ... [2024-11-07 04:56:19,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:19" (1/1) ... [2024-11-07 04:56:19,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:19" (1/1) ... [2024-11-07 04:56:19,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:56:19,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:56:19,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:56:19,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:56:19,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:19" (1/1) ... [2024-11-07 04:56:19,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:56:19,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:56:20,007 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 04:56:20,009 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 04:56:20,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:56:20,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 04:56:20,025 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:56:20,025 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:56:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:56:20,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:56:20,097 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:56:20,098 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:56:32,548 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 04:56:32,548 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:56:32,555 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:56:32,555 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:56:32,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:56:32 BoogieIcfgContainer [2024-11-07 04:56:32,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:56:32,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:56:32,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:56:32,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:56:32,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:56:19" (1/3) ... [2024-11-07 04:56:32,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d629118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:56:32, skipping insertion in model container [2024-11-07 04:56:32,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:19" (2/3) ... [2024-11-07 04:56:32,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d629118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:56:32, skipping insertion in model container [2024-11-07 04:56:32,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:56:32" (3/3) ... [2024-11-07 04:56:32,564 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-51.i [2024-11-07 04:56:32,573 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:56:32,573 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:56:32,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:56:32,615 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;@5df45434, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:56:32,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:56:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 53 states have internal predecessors, (71), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 04:56:32,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 04:56:32,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:56:32,627 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:32,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:56:32,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:56:32,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1762583813, now seen corresponding path program 1 times [2024-11-07 04:56:32,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:56:32,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92551178] [2024-11-07 04:56:32,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:32,638 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 04:56:32,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:56:32,640 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 04:56:32,642 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 04:56:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:33,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 04:56:33,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:56:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 1508 trivial. 0 not checked. [2024-11-07 04:56:33,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:56:33,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:56:33,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92551178] [2024-11-07 04:56:33,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92551178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:56:33,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:56:33,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:56:33,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404589953] [2024-11-07 04:56:33,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:56:33,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:56:33,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:56:33,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:56:33,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:56:33,497 INFO L87 Difference]: Start difference. First operand has 88 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 53 states have internal predecessors, (71), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 04:56:33,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:56:33,519 INFO L93 Difference]: Finished difference Result 169 states and 301 transitions. [2024-11-07 04:56:33,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:56:33,520 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 203 [2024-11-07 04:56:33,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:56:33,528 INFO L225 Difference]: With dead ends: 169 [2024-11-07 04:56:33,528 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 04:56:33,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 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 04:56:33,531 INFO L432 NwaCegarLoop]: 130 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, 130 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 04:56:33,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:56:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 04:56:33,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-07 04:56:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 04:56:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 130 transitions. [2024-11-07 04:56:33,558 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 130 transitions. Word has length 203 [2024-11-07 04:56:33,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:56:33,558 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 130 transitions. [2024-11-07 04:56:33,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 04:56:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 130 transitions. [2024-11-07 04:56:33,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 04:56:33,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:56:33,564 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:33,588 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-07 04:56:33,764 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 04:56:33,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:56:33,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:56:33,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1964910719, now seen corresponding path program 1 times [2024-11-07 04:56:33,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:56:33,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120366387] [2024-11-07 04:56:33,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:33,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:56:33,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:56:33,769 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 04:56:33,770 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 04:56:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:34,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 04:56:34,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:56:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 04:56:38,548 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:56:38,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:56:38,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120366387] [2024-11-07 04:56:38,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120366387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:56:38,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:56:38,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:56:38,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093078324] [2024-11-07 04:56:38,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:56:38,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:56:38,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:56:38,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:56:38,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:56:38,553 INFO L87 Difference]: Start difference. First operand 84 states and 130 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 04:56:42,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:56:47,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:56:51,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:56:55,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:56:59,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:57:03,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:57:03,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:57:03,938 INFO L93 Difference]: Finished difference Result 247 states and 385 transitions. [2024-11-07 04:57:04,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:57:04,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 203 [2024-11-07 04:57:04,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:57:04,033 INFO L225 Difference]: With dead ends: 247 [2024-11-07 04:57:04,033 INFO L226 Difference]: Without dead ends: 166 [2024-11-07 04:57:04,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:57:04,034 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 82 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 67 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:57:04,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 367 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 25.3s Time] [2024-11-07 04:57:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-07 04:57:04,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 145. [2024-11-07 04:57:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 04:57:04,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 225 transitions. [2024-11-07 04:57:04,073 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 225 transitions. Word has length 203 [2024-11-07 04:57:04,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:57:04,073 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 225 transitions. [2024-11-07 04:57:04,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 04:57:04,074 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 225 transitions. [2024-11-07 04:57:04,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 04:57:04,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:57:04,075 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:57:04,098 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 04:57:04,276 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 04:57:04,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:57:04,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:57:04,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1671135613, now seen corresponding path program 1 times [2024-11-07 04:57:04,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:57:04,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499337765] [2024-11-07 04:57:04,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:57:04,277 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 04:57:04,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:57:04,279 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 04:57:04,280 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 04:57:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:57:05,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 04:57:05,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:57:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 04:57:09,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:57:09,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:57:09,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499337765] [2024-11-07 04:57:09,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499337765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:57:09,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:57:09,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:57:09,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649017145] [2024-11-07 04:57:09,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:57:09,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 04:57:09,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:57:09,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 04:57:09,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:57:09,317 INFO L87 Difference]: Start difference. First operand 145 states and 225 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 04:57:14,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:57:18,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:57:22,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:57:27,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:57:31,120 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 04:57:35,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:57:39,549 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 04:57:43,556 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 04:57:43,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:57:43,557 INFO L93 Difference]: Finished difference Result 314 states and 486 transitions. [2024-11-07 04:57:43,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 04:57:43,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2024-11-07 04:57:43,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:57:43,653 INFO L225 Difference]: With dead ends: 314 [2024-11-07 04:57:43,653 INFO L226 Difference]: Without dead ends: 233 [2024-11-07 04:57:43,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:57:43,654 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 92 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 67 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:57:43,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 435 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 88 Invalid, 8 Unknown, 0 Unchecked, 34.0s Time] [2024-11-07 04:57:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-07 04:57:43,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 224. [2024-11-07 04:57:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 121 states have (on average 1.256198347107438) internal successors, (152), 121 states have internal predecessors, (152), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-07 04:57:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 350 transitions. [2024-11-07 04:57:43,679 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 350 transitions. Word has length 204 [2024-11-07 04:57:43,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:57:43,679 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 350 transitions. [2024-11-07 04:57:43,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 04:57:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 350 transitions. [2024-11-07 04:57:43,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-07 04:57:43,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:57:43,681 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:57:43,706 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 04:57:43,884 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 04:57:43,884 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:57:43,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:57:43,885 INFO L85 PathProgramCache]: Analyzing trace with hash 833854104, now seen corresponding path program 1 times [2024-11-07 04:57:43,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:57:43,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223722056] [2024-11-07 04:57:43,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:57:43,885 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 04:57:43,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:57:43,887 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 04:57:43,889 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 04:57:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:57:44,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 04:57:44,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:57:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 04:57:44,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:57:44,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:57:44,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223722056] [2024-11-07 04:57:44,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223722056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:57:44,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:57:44,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:57:44,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526663834] [2024-11-07 04:57:44,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:57:44,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:57:44,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:57:44,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:57:44,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:57:44,739 INFO L87 Difference]: Start difference. First operand 224 states and 350 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 04:57:49,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []