./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.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', '50d5d35851cc8e5f5376c9c4d834d542e4edd508da7d290798477fa80ae9c511'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.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 50d5d35851cc8e5f5376c9c4d834d542e4edd508da7d290798477fa80ae9c511 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:21:30,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:21:30,777 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:21:30,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:21:30,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:21:30,810 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:21:30,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:21:30,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:21:30,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:21:30,813 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:21:30,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:21:30,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:21:30,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:21:30,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:21:30,814 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:21:30,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:21:30,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:21:30,814 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:21:30,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:21:30,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:21:30,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:21:30,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:21:30,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:21:30,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:21:30,815 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:21:30,815 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:21:30,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:21:30,815 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:21:30,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:21:30,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:21:30,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:21:30,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:21:30,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:21:30,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:21:30,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:21:30,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:21:30,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:21:30,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:21:30,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:21:30,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:21:30,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:21:30,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:21:30,817 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 -> 50d5d35851cc8e5f5376c9c4d834d542e4edd508da7d290798477fa80ae9c511 [2024-11-07 07:21:31,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:21:31,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:21:31,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:21:31,048 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:21:31,048 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:21:31,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i [2024-11-07 07:21:32,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:21:32,648 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:21:32,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i [2024-11-07 07:21:32,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04cf4904e/f1b562ef74b74d9ca4afc5d9350ab033/FLAG161c27794 [2024-11-07 07:21:32,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04cf4904e/f1b562ef74b74d9ca4afc5d9350ab033 [2024-11-07 07:21:32,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:21:32,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:21:32,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:21:32,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:21:32,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:21:32,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:21:32" (1/1) ... [2024-11-07 07:21:32,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2958bd7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:32, skipping insertion in model container [2024-11-07 07:21:32,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:21:32" (1/1) ... [2024-11-07 07:21:32,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:21:32,828 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i[919,932] [2024-11-07 07:21:32,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:21:32,923 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:21:32,934 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i[919,932] [2024-11-07 07:21:32,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:21:32,972 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:21:32,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:32 WrapperNode [2024-11-07 07:21:32,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:21:32,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:21:32,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:21:32,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:21:32,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:32" (1/1) ... [2024-11-07 07:21:33,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:32" (1/1) ... [2024-11-07 07:21:33,033 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 296 [2024-11-07 07:21:33,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:21:33,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:21:33,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:21:33,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:21:33,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:32" (1/1) ... [2024-11-07 07:21:33,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:32" (1/1) ... [2024-11-07 07:21:33,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:32" (1/1) ... [2024-11-07 07:21:33,059 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 07:21:33,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:32" (1/1) ... [2024-11-07 07:21:33,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:32" (1/1) ... [2024-11-07 07:21:33,067 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:32" (1/1) ... [2024-11-07 07:21:33,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:32" (1/1) ... [2024-11-07 07:21:33,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:32" (1/1) ... [2024-11-07 07:21:33,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:32" (1/1) ... [2024-11-07 07:21:33,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:21:33,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:21:33,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:21:33,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:21:33,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:32" (1/1) ... [2024-11-07 07:21:33,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:21:33,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:21:33,110 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 07:21:33,112 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 07:21:33,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:21:33,128 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:21:33,128 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:21:33,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:21:33,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:21:33,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:21:33,192 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:21:33,194 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:21:33,635 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-07 07:21:33,635 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:21:33,644 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:21:33,646 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:21:33,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:21:33 BoogieIcfgContainer [2024-11-07 07:21:33,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:21:33,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:21:33,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:21:33,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:21:33,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:21:32" (1/3) ... [2024-11-07 07:21:33,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326ad54a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:21:33, skipping insertion in model container [2024-11-07 07:21:33,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:32" (2/3) ... [2024-11-07 07:21:33,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326ad54a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:21:33, skipping insertion in model container [2024-11-07 07:21:33,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:21:33" (3/3) ... [2024-11-07 07:21:33,654 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i [2024-11-07 07:21:33,664 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:21:33,665 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:21:33,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:21:33,724 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;@136de417, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:21:33,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:21:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 90 states have (on average 1.4777777777777779) internal successors, (133), 91 states have internal predecessors, (133), 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 07:21:33,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-07 07:21:33,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:21:33,740 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, 1, 1, 1, 1, 1] [2024-11-07 07:21:33,740 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:21:33,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:21:33,745 INFO L85 PathProgramCache]: Analyzing trace with hash -61352157, now seen corresponding path program 1 times [2024-11-07 07:21:33,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:21:33,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542699520] [2024-11-07 07:21:33,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:21:33,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:21:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:33,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:21:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:33,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:21:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:33,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:21:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:33,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 07:21:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:33,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:21:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:33,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:21:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:33,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:21:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:33,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:21:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:33,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:21:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:33,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:21:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:33,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:21:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:33,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:21:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:33,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:21:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:33,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:21:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:33,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:21:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:21:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:21:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:21:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:21:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:21:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:21:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 07:21:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:21:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:21:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:21:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:21:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 07:21:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:21:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 07:21:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 07:21:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 07:21:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 07:21:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 07:21:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,131 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 07:21:34,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:21:34,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542699520] [2024-11-07 07:21:34,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542699520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:21:34,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:21:34,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:21:34,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708143460] [2024-11-07 07:21:34,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:21:34,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:21:34,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:21:34,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:21:34,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:21:34,171 INFO L87 Difference]: Start difference. First operand has 126 states, 90 states have (on average 1.4777777777777779) internal successors, (133), 91 states have internal predecessors, (133), 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 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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 07:21:34,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:21:34,213 INFO L93 Difference]: Finished difference Result 244 states and 424 transitions. [2024-11-07 07:21:34,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:21:34,215 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (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 212 [2024-11-07 07:21:34,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:21:34,223 INFO L225 Difference]: With dead ends: 244 [2024-11-07 07:21:34,223 INFO L226 Difference]: Without dead ends: 121 [2024-11-07 07:21:34,227 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 07:21:34,230 INFO L432 NwaCegarLoop]: 188 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, 188 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 07:21:34,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:21:34,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-07 07:21:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-07 07:21:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 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 07:21:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 188 transitions. [2024-11-07 07:21:34,268 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 188 transitions. Word has length 212 [2024-11-07 07:21:34,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:21:34,269 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 188 transitions. [2024-11-07 07:21:34,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (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 07:21:34,269 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 188 transitions. [2024-11-07 07:21:34,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-07 07:21:34,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:21:34,274 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, 1, 1, 1, 1, 1] [2024-11-07 07:21:34,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:21:34,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:21:34,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:21:34,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1105090319, now seen corresponding path program 1 times [2024-11-07 07:21:34,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:21:34,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691668215] [2024-11-07 07:21:34,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:21:34,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:21:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:21:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:21:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:21:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 07:21:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:21:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:21:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:21:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:21:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:21:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:21:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:21:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:21:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:21:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:21:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:21:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:21:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:21:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:21:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:21:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:21:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:21:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 07:21:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:21:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:21:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:21:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:21:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 07:21:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:21:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 07:21:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 07:21:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 07:21:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 07:21:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 07:21:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,646 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 07:21:34,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:21:34,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691668215] [2024-11-07 07:21:34,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691668215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:21:34,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:21:34,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:21:34,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558547012] [2024-11-07 07:21:34,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:21:34,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:21:34,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:21:34,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:21:34,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:21:34,653 INFO L87 Difference]: Start difference. First operand 121 states and 188 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (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 07:21:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:21:34,750 INFO L93 Difference]: Finished difference Result 342 states and 533 transitions. [2024-11-07 07:21:34,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:21:34,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (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 212 [2024-11-07 07:21:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:21:34,755 INFO L225 Difference]: With dead ends: 342 [2024-11-07 07:21:34,755 INFO L226 Difference]: Without dead ends: 224 [2024-11-07 07:21:34,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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 07:21:34,758 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 152 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:21:34,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 344 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:21:34,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-07 07:21:34,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 208. [2024-11-07 07:21:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 139 states have internal predecessors, (186), 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 07:21:34,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 318 transitions. [2024-11-07 07:21:34,793 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 318 transitions. Word has length 212 [2024-11-07 07:21:34,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:21:34,795 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 318 transitions. [2024-11-07 07:21:34,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (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 07:21:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 318 transitions. [2024-11-07 07:21:34,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-07 07:21:34,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:21:34,799 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, 1, 1, 1, 1, 1] [2024-11-07 07:21:34,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:21:34,800 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:21:34,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:21:34,800 INFO L85 PathProgramCache]: Analyzing trace with hash -682388493, now seen corresponding path program 1 times [2024-11-07 07:21:34,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:21:34,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456870950] [2024-11-07 07:21:34,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:21:34,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:21:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:21:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:21:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:21:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 07:21:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:21:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:21:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:21:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:21:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:21:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:21:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:21:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:21:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:21:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:21:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:21:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:21:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:21:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:34,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:21:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:21:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:21:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:21:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 07:21:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:21:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:21:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:21:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:21:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 07:21:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:21:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 07:21:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 07:21:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 07:21:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 07:21:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 07:21:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,039 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 07:21:35,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:21:35,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456870950] [2024-11-07 07:21:35,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456870950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:21:35,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:21:35,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:21:35,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609090990] [2024-11-07 07:21:35,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:21:35,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:21:35,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:21:35,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:21:35,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:21:35,042 INFO L87 Difference]: Start difference. First operand 208 states and 318 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (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 07:21:35,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:21:35,116 INFO L93 Difference]: Finished difference Result 429 states and 657 transitions. [2024-11-07 07:21:35,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:21:35,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (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 212 [2024-11-07 07:21:35,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:21:35,119 INFO L225 Difference]: With dead ends: 429 [2024-11-07 07:21:35,122 INFO L226 Difference]: Without dead ends: 224 [2024-11-07 07:21:35,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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 07:21:35,124 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 174 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:21:35,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 468 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:21:35,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-07 07:21:35,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 208. [2024-11-07 07:21:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 139 states have (on average 1.2877697841726619) internal successors, (179), 139 states have internal predecessors, (179), 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 07:21:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 311 transitions. [2024-11-07 07:21:35,150 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 311 transitions. Word has length 212 [2024-11-07 07:21:35,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:21:35,150 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 311 transitions. [2024-11-07 07:21:35,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (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 07:21:35,151 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 311 transitions. [2024-11-07 07:21:35,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-07 07:21:35,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:21:35,152 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, 1, 1, 1, 1, 1] [2024-11-07 07:21:35,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:21:35,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:21:35,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:21:35,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1962252171, now seen corresponding path program 1 times [2024-11-07 07:21:35,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:21:35,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744127730] [2024-11-07 07:21:35,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:21:35,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:21:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:21:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:21:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:21:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 07:21:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:21:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:21:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:21:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:21:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:21:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:21:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:21:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:21:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:21:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:21:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:21:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:21:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:21:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:21:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:21:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:21:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:21:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 07:21:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:21:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:21:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:21:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:21:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 07:21:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:21:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 07:21:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 07:21:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 07:21:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 07:21:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 07:21:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:35,609 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 07:21:35,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:21:35,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744127730] [2024-11-07 07:21:35,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744127730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:21:35,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:21:35,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:21:35,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137689347] [2024-11-07 07:21:35,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:21:35,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:21:35,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:21:35,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:21:35,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:21:35,612 INFO L87 Difference]: Start difference. First operand 208 states and 311 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 07:21:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:21:36,008 INFO L93 Difference]: Finished difference Result 592 states and 892 transitions. [2024-11-07 07:21:36,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:21:36,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 212 [2024-11-07 07:21:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:21:36,016 INFO L225 Difference]: With dead ends: 592 [2024-11-07 07:21:36,016 INFO L226 Difference]: Without dead ends: 387 [2024-11-07 07:21:36,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:21:36,019 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 237 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 07:21:36,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 614 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 07:21:36,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-07 07:21:36,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 310. [2024-11-07 07:21:36,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 207 states have (on average 1.285024154589372) internal successors, (266), 207 states have internal predecessors, (266), 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 07:21:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 464 transitions. [2024-11-07 07:21:36,086 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 464 transitions. Word has length 212 [2024-11-07 07:21:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:21:36,087 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 464 transitions. [2024-11-07 07:21:36,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 07:21:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 464 transitions. [2024-11-07 07:21:36,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-07 07:21:36,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:21:36,088 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, 1, 1, 1, 1, 1, 1] [2024-11-07 07:21:36,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:21:36,088 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:21:36,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:21:36,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1477823945, now seen corresponding path program 1 times [2024-11-07 07:21:36,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:21:36,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694813606] [2024-11-07 07:21:36,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:21:36,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:21:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:21:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:21:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:21:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 07:21:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:21:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:21:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:21:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:21:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:21:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:21:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:21:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:21:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:21:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:21:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:21:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:21:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:21:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:21:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:21:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:21:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:21:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 07:21:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:21:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:21:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:21:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:21:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 07:21:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:21:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 07:21:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 07:21:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 07:21:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 07:21:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 07:21:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:36,609 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 07:21:36,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:21:36,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694813606] [2024-11-07 07:21:36,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694813606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:21:36,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:21:36,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 07:21:36,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283447125] [2024-11-07 07:21:36,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:21:36,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 07:21:36,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:21:36,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 07:21:36,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:21:36,611 INFO L87 Difference]: Start difference. First operand 310 states and 464 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 07:21:37,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:21:37,049 INFO L93 Difference]: Finished difference Result 738 states and 1099 transitions. [2024-11-07 07:21:37,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:21:37,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 213 [2024-11-07 07:21:37,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:21:37,054 INFO L225 Difference]: With dead ends: 738 [2024-11-07 07:21:37,054 INFO L226 Difference]: Without dead ends: 431 [2024-11-07 07:21:37,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:21:37,055 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 139 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:21:37,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 900 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 07:21:37,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-07 07:21:37,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 415. [2024-11-07 07:21:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 278 states have (on average 1.2697841726618706) internal successors, (353), 278 states have internal predecessors, (353), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-07 07:21:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 617 transitions. [2024-11-07 07:21:37,099 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 617 transitions. Word has length 213 [2024-11-07 07:21:37,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:21:37,100 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 617 transitions. [2024-11-07 07:21:37,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 07:21:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 617 transitions. [2024-11-07 07:21:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 07:21:37,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:21:37,102 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:21:37,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 07:21:37,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:21:37,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:21:37,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1229641037, now seen corresponding path program 1 times [2024-11-07 07:21:37,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:21:37,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247185490] [2024-11-07 07:21:37,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:21:37,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:21:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:21:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:21:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:21:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 07:21:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:21:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:21:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:21:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:21:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:21:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:21:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:21:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:21:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:21:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:21:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:21:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:21:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:21:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:21:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:21:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:21:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:21:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 07:21:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:21:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:21:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:21:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:21:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 07:21:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:21:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 07:21:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 07:21:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 07:21:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 07:21:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 07:21:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:37,354 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 07:21:37,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:21:37,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247185490] [2024-11-07 07:21:37,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247185490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:21:37,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:21:37,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:21:37,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592689868] [2024-11-07 07:21:37,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:21:37,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:21:37,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:21:37,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:21:37,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:21:37,356 INFO L87 Difference]: Start difference. First operand 415 states and 617 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 07:21:37,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:21:37,782 INFO L93 Difference]: Finished difference Result 714 states and 1068 transitions. [2024-11-07 07:21:37,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:21:37,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 214 [2024-11-07 07:21:37,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:21:37,786 INFO L225 Difference]: With dead ends: 714 [2024-11-07 07:21:37,786 INFO L226 Difference]: Without dead ends: 509 [2024-11-07 07:21:37,787 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 07:21:37,788 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 294 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 07:21:37,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1013 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 07:21:37,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-07 07:21:37,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 415. [2024-11-07 07:21:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 278 states have (on average 1.2661870503597121) internal successors, (352), 278 states have internal predecessors, (352), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-07 07:21:37,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 616 transitions. [2024-11-07 07:21:37,832 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 616 transitions. Word has length 214 [2024-11-07 07:21:37,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:21:37,833 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 616 transitions. [2024-11-07 07:21:37,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 07:21:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 616 transitions. [2024-11-07 07:21:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 07:21:37,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:21:37,835 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:21:37,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 07:21:37,835 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:21:37,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:21:37,835 INFO L85 PathProgramCache]: Analyzing trace with hash -638217310, now seen corresponding path program 1 times [2024-11-07 07:21:37,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:21:37,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931768442] [2024-11-07 07:21:37,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:21:37,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:21:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:21:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:21:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:21:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 07:21:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:21:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:21:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:21:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:21:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:21:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:21:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:21:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:21:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:21:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:21:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:21:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:21:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:21:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:21:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:21:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:21:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:21:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 07:21:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:21:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:21:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:21:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:21:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 07:21:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:21:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 07:21:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 07:21:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 07:21:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 07:21:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 07:21:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,157 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 07:21:38,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:21:38,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931768442] [2024-11-07 07:21:38,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931768442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:21:38,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:21:38,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:21:38,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819636324] [2024-11-07 07:21:38,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:21:38,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:21:38,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:21:38,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:21:38,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:21:38,161 INFO L87 Difference]: Start difference. First operand 415 states and 616 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 07:21:38,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:21:38,313 INFO L93 Difference]: Finished difference Result 902 states and 1345 transitions. [2024-11-07 07:21:38,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:21:38,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 214 [2024-11-07 07:21:38,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:21:38,317 INFO L225 Difference]: With dead ends: 902 [2024-11-07 07:21:38,318 INFO L226 Difference]: Without dead ends: 490 [2024-11-07 07:21:38,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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 07:21:38,319 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 161 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:21:38,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 696 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:21:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-07 07:21:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 415. [2024-11-07 07:21:38,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 278 states have (on average 1.2482014388489209) internal successors, (347), 278 states have internal predecessors, (347), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-07 07:21:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 611 transitions. [2024-11-07 07:21:38,384 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 611 transitions. Word has length 214 [2024-11-07 07:21:38,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:21:38,384 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 611 transitions. [2024-11-07 07:21:38,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 07:21:38,384 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 611 transitions. [2024-11-07 07:21:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-07 07:21:38,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:21:38,386 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:21:38,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 07:21:38,386 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:21:38,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:21:38,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1632811421, now seen corresponding path program 1 times [2024-11-07 07:21:38,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:21:38,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141224237] [2024-11-07 07:21:38,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:21:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:21:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:21:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:21:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:21:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 07:21:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:21:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:21:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:21:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:21:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:21:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:21:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:21:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:21:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:21:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:21:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:21:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:21:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:21:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:21:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:21:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:21:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:21:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 07:21:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:21:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:21:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:21:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:21:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 07:21:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:21:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 07:21:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 07:21:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 07:21:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 07:21:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 07:21:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,584 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 07:21:38,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:21:38,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141224237] [2024-11-07 07:21:38,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141224237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:21:38,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:21:38,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:21:38,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161238242] [2024-11-07 07:21:38,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:21:38,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:21:38,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:21:38,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:21:38,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:21:38,586 INFO L87 Difference]: Start difference. First operand 415 states and 611 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 07:21:38,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:21:38,659 INFO L93 Difference]: Finished difference Result 621 states and 918 transitions. [2024-11-07 07:21:38,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:21:38,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 218 [2024-11-07 07:21:38,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:21:38,663 INFO L225 Difference]: With dead ends: 621 [2024-11-07 07:21:38,664 INFO L226 Difference]: Without dead ends: 416 [2024-11-07 07:21:38,664 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 07:21:38,665 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:21:38,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 366 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:21:38,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-07 07:21:38,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-11-07 07:21:38,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 279 states have (on average 1.2473118279569892) internal successors, (348), 279 states have internal predecessors, (348), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-07 07:21:38,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 612 transitions. [2024-11-07 07:21:38,742 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 612 transitions. Word has length 218 [2024-11-07 07:21:38,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:21:38,743 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 612 transitions. [2024-11-07 07:21:38,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 07:21:38,743 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 612 transitions. [2024-11-07 07:21:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-07 07:21:38,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:21:38,745 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:21:38,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 07:21:38,746 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:21:38,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:21:38,746 INFO L85 PathProgramCache]: Analyzing trace with hash 44463519, now seen corresponding path program 1 times [2024-11-07 07:21:38,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:21:38,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289168436] [2024-11-07 07:21:38,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:21:38,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:21:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:21:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:21:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:21:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 07:21:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:21:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:21:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:21:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:21:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:21:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:21:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:21:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:21:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:21:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:21:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:21:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:38,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:21:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:39,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:21:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:39,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:21:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:39,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:21:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:39,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:21:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:39,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:21:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:39,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 07:21:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:39,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:21:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:39,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:21:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:39,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:21:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:39,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:21:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:39,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 07:21:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:39,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:21:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:39,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 07:21:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:39,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 07:21:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:39,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 07:21:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:39,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 07:21:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:39,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 07:21:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:39,047 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 07:21:39,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:21:39,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289168436] [2024-11-07 07:21:39,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289168436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:21:39,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:21:39,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:21:39,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641762378] [2024-11-07 07:21:39,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:21:39,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:21:39,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:21:39,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:21:39,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:21:39,049 INFO L87 Difference]: Start difference. First operand 416 states and 612 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 07:21:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:21:39,670 INFO L93 Difference]: Finished difference Result 1118 states and 1626 transitions. [2024-11-07 07:21:39,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:21:39,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 218 [2024-11-07 07:21:39,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:21:39,677 INFO L225 Difference]: With dead ends: 1118 [2024-11-07 07:21:39,677 INFO L226 Difference]: Without dead ends: 912 [2024-11-07 07:21:39,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:21:39,679 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 401 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:21:39,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 741 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 07:21:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2024-11-07 07:21:39,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 731. [2024-11-07 07:21:39,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 492 states have (on average 1.2357723577235773) internal successors, (608), 492 states have internal predecessors, (608), 231 states have call successors, (231), 7 states have call predecessors, (231), 7 states have return successors, (231), 231 states have call predecessors, (231), 231 states have call successors, (231) [2024-11-07 07:21:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1070 transitions. [2024-11-07 07:21:39,809 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1070 transitions. Word has length 218 [2024-11-07 07:21:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:21:39,810 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1070 transitions. [2024-11-07 07:21:39,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 07:21:39,810 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1070 transitions. [2024-11-07 07:21:39,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-07 07:21:39,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:21:39,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:21:39,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 07:21:39,812 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:21:39,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:21:39,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1049602151, now seen corresponding path program 1 times [2024-11-07 07:21:39,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:21:39,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628172417] [2024-11-07 07:21:39,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:21:39,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:21:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:21:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:21:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:21:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 07:21:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:21:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:21:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:21:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:21:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:21:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:21:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:21:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:21:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:21:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:21:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:21:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:21:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:21:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:21:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:21:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:21:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:21:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 07:21:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:21:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:21:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:21:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:21:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 07:21:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:21:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 07:21:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 07:21:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 07:21:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 07:21:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 07:21:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:44,849 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 07:21:44,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:21:44,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628172417] [2024-11-07 07:21:44,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628172417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:21:44,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:21:44,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 07:21:44,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376990280] [2024-11-07 07:21:44,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:21:44,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 07:21:44,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:21:44,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 07:21:44,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:21:44,853 INFO L87 Difference]: Start difference. First operand 731 states and 1070 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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 07:21:46,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:21:46,566 INFO L93 Difference]: Finished difference Result 1361 states and 1921 transitions. [2024-11-07 07:21:46,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 07:21:46,567 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), 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 218 [2024-11-07 07:21:46,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:21:46,573 INFO L225 Difference]: With dead ends: 1361 [2024-11-07 07:21:46,573 INFO L226 Difference]: Without dead ends: 1053 [2024-11-07 07:21:46,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-07 07:21:46,576 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 183 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 07:21:46,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 569 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 07:21:46,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-11-07 07:21:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1005. [2024-11-07 07:21:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 748 states have (on average 1.2339572192513368) internal successors, (923), 754 states have internal predecessors, (923), 243 states have call successors, (243), 13 states have call predecessors, (243), 13 states have return successors, (243), 237 states have call predecessors, (243), 243 states have call successors, (243) [2024-11-07 07:21:46,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1409 transitions. [2024-11-07 07:21:46,676 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1409 transitions. Word has length 218 [2024-11-07 07:21:46,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:21:46,676 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1409 transitions. [2024-11-07 07:21:46,676 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), 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 07:21:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1409 transitions. [2024-11-07 07:21:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-07 07:21:46,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:21:46,679 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:21:46,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 07:21:46,679 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:21:46,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:21:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1439926811, now seen corresponding path program 1 times [2024-11-07 07:21:46,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:21:46,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695120238] [2024-11-07 07:21:46,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:21:46,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:21:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 07:21:46,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1902381366] [2024-11-07 07:21:46,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:21:46,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:21:46,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:21:46,763 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 07:21:46,773 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 07:21:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:21:46,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 07:21:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:21:47,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 07:21:47,085 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 07:21:47,086 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:21:47,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 07:21:47,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 07:21:47,292 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:21:47,439 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:21:47,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:21:47 BoogieIcfgContainer [2024-11-07 07:21:47,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:21:47,443 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:21:47,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:21:47,444 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:21:47,445 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:21:33" (3/4) ... [2024-11-07 07:21:47,446 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 07:21:47,447 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:21:47,448 INFO L158 Benchmark]: Toolchain (without parser) took 14758.90ms. Allocated memory was 117.4MB in the beginning and 545.3MB in the end (delta: 427.8MB). Free memory was 91.7MB in the beginning and 300.3MB in the end (delta: -208.7MB). Peak memory consumption was 222.9MB. Max. memory is 16.1GB. [2024-11-07 07:21:47,448 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:21:47,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.24ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 75.2MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:21:47,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.46ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 69.8MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:21:47,448 INFO L158 Benchmark]: Boogie Preprocessor took 44.26ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 62.3MB in the end (delta: 7.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:21:47,448 INFO L158 Benchmark]: RCFGBuilder took 567.49ms. Allocated memory is still 117.4MB. Free memory was 62.3MB in the beginning and 71.7MB in the end (delta: -9.4MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2024-11-07 07:21:47,449 INFO L158 Benchmark]: TraceAbstraction took 13794.65ms. Allocated memory was 117.4MB in the beginning and 545.3MB in the end (delta: 427.8MB). Free memory was 71.2MB in the beginning and 300.5MB in the end (delta: -229.2MB). Peak memory consumption was 191.6MB. Max. memory is 16.1GB. [2024-11-07 07:21:47,449 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 545.3MB. Free memory was 300.5MB in the beginning and 300.3MB in the end (delta: 142.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:21:47,450 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.29ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.24ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 75.2MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.46ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 69.8MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.26ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 62.3MB in the end (delta: 7.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 567.49ms. Allocated memory is still 117.4MB. Free memory was 62.3MB in the beginning and 71.7MB in the end (delta: -9.4MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13794.65ms. Allocated memory was 117.4MB in the beginning and 545.3MB in the end (delta: 427.8MB). Free memory was 71.2MB in the beginning and 300.5MB in the end (delta: -229.2MB). Peak memory consumption was 191.6MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 545.3MB. Free memory was 300.5MB in the beginning and 300.3MB in the end (delta: 142.6kB). 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 someBinaryFLOATComparisonOperation at line 201, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someUnaryDOUBLEoperation at line 48. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] signed char var_1_27 = 64; [L41] unsigned short int var_1_29 = 8; [L42] unsigned char var_1_30 = 16; [L43] unsigned short int var_1_33 = 48416; [L44] unsigned char var_1_35 = 4; [L45] unsigned char var_1_36 = 25; [L46] unsigned long int var_1_37 = 32; [L47] unsigned char var_1_38 = 8; [L48] double var_1_39 = -0.75; [L49] double var_1_40 = 31.75; [L50] double var_1_41 = 5.5; [L51] double var_1_42 = 32.5; [L52] signed char var_1_43 = 100; [L53] signed char var_1_44 = 50; [L54] signed char var_1_45 = 5; [L55] signed long int last_1_var_1_5 = 5; VAL [isInitial=0, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0, var_1_9=643/5] [L205] isInitial = 1 [L206] FCALL initially() [L207] COND TRUE 1 [L208] CALL updateLastVariables() [L198] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0, var_1_9=643/5] [L208] RET updateLastVariables() [L209] CALL updateVariables() [L144] var_1_9 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L145] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L146] var_1_10 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L147] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L148] var_1_11 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L149] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L150] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L150] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L151] var_1_12 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L152] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L153] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L153] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L154] var_1_13 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L155] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L156] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L156] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L157] var_1_14 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L159] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L160] var_1_18 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L161] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L162] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L162] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L163] var_1_19 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L164] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L165] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L165] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L166] var_1_23 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L167] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L168] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L168] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L169] var_1_27 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L170] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L171] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L171] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L172] var_1_30 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L173] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L174] CALL assume_abort_if_not(var_1_30 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L174] RET assume_abort_if_not(var_1_30 <= 255) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L175] CALL assume_abort_if_not(var_1_30 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L175] RET assume_abort_if_not(var_1_30 != 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L176] var_1_33 = __VERIFIER_nondet_ushort() [L177] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L177] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L178] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L178] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L179] var_1_36 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L180] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L181] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L181] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L182] var_1_39 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L183] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L184] var_1_40 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L185] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L186] var_1_41 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L187] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L188] var_1_42 = __VERIFIER_nondet_double() [L189] CALL assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L189] RET assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L190] var_1_44 = __VERIFIER_nondet_char() [L191] CALL assume_abort_if_not(var_1_44 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L191] RET assume_abort_if_not(var_1_44 >= -1) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L192] CALL assume_abort_if_not(var_1_44 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L192] RET assume_abort_if_not(var_1_44 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L193] var_1_45 = __VERIFIER_nondet_char() [L194] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L194] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L195] CALL assume_abort_if_not(var_1_45 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L195] RET assume_abort_if_not(var_1_45 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L209] RET updateVariables() [L210] CALL step() [L59] COND FALSE !(\read(var_1_22)) [L64] var_1_24 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=8, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L66] COND TRUE (var_1_20 / var_1_30) < var_1_27 [L67] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L71] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L74] COND TRUE ((((var_1_8) < (var_1_1)) ? (var_1_8) : (var_1_1))) >= var_1_15 [L75] var_1_37 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L77] COND FALSE !((var_1_39 * (var_1_40 - var_1_41)) >= var_1_42) [L84] var_1_38 = var_1_36 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L86] COND FALSE !(((((var_1_39) > (64.75f)) ? (var_1_39) : (64.75f))) <= var_1_40) [L93] var_1_43 = var_1_44 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L95] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L98] var_1_20 = var_1_8 [L99] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L100] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L103] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L104] COND FALSE !(\read(var_1_22)) [L111] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L113] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L114] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L115] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L116] COND FALSE !(\read(var_1_22)) [L123] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L128] signed long int stepLocal_4 = 256; [L129] unsigned char stepLocal_3 = var_1_22; [L130] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L131] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L134] COND FALSE !(stepLocal_3 || var_1_22) [L139] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L210] RET step() [L211] CALL, EXPR property() [L201] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201-L202] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L211] RET, EXPR property() [L211] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=-256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=0, var_1_29=64, var_1_30=64, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=-64, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 11, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1741 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1741 mSDsluCounter, 5899 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3502 mSDsCounter, 482 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1528 IncrementalHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 482 mSolverCounterUnsat, 2397 mSDtfsCounter, 1528 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 759 GetRequests, 719 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1005occurred in iteration=10, 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.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 523 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 2579 NumberOfCodeBlocks, 2579 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2133 ConstructedInterpolants, 0 QuantifiedInterpolants, 11829 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 21120/21120 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 07:21:47,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.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 50d5d35851cc8e5f5376c9c4d834d542e4edd508da7d290798477fa80ae9c511 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:21:49,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:21:49,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 07:21:49,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:21:49,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:21:49,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:21:49,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:21:49,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:21:49,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:21:49,658 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:21:49,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:21:49,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:21:49,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:21:49,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:21:49,659 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:21:49,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:21:49,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:21:49,659 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:21:49,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:21:49,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:21:49,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:21:49,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:21:49,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:21:49,659 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 07:21:49,659 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 07:21:49,659 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:21:49,659 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 07:21:49,659 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:21:49,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:21:49,660 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:21:49,660 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:21:49,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:21:49,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:21:49,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:21:49,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:21:49,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:21:49,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:21:49,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:21:49,662 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 07:21:49,662 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 07:21:49,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:21:49,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:21:49,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:21:49,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:21:49,663 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 -> 50d5d35851cc8e5f5376c9c4d834d542e4edd508da7d290798477fa80ae9c511 [2024-11-07 07:21:49,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:21:49,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:21:49,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:21:49,906 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:21:49,907 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:21:49,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i [2024-11-07 07:21:51,251 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:21:51,607 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:21:51,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i [2024-11-07 07:21:51,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/168e1d4e5/8971f8795c2a4d8da8a0971ff827701a/FLAG35848162e [2024-11-07 07:21:51,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/168e1d4e5/8971f8795c2a4d8da8a0971ff827701a [2024-11-07 07:21:51,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:21:51,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:21:51,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:21:51,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:21:51,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:21:51,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:21:51" (1/1) ... [2024-11-07 07:21:51,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f01534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:51, skipping insertion in model container [2024-11-07 07:21:51,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:21:51" (1/1) ... [2024-11-07 07:21:51,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:21:51,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_fillercodestructure_filler-ps-co_file-97.i[919,932] [2024-11-07 07:21:51,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:21:51,903 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:21:51,918 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i[919,932] [2024-11-07 07:21:51,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:21:51,982 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:21:51,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:51 WrapperNode [2024-11-07 07:21:51,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:21:51,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:21:51,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:21:51,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:21:51,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:51" (1/1) ... [2024-11-07 07:21:51,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:51" (1/1) ... [2024-11-07 07:21:52,026 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-11-07 07:21:52,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:21:52,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:21:52,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:21:52,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:21:52,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:51" (1/1) ... [2024-11-07 07:21:52,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:51" (1/1) ... [2024-11-07 07:21:52,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:51" (1/1) ... [2024-11-07 07:21:52,061 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 07:21:52,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:51" (1/1) ... [2024-11-07 07:21:52,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:51" (1/1) ... [2024-11-07 07:21:52,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:51" (1/1) ... [2024-11-07 07:21:52,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:51" (1/1) ... [2024-11-07 07:21:52,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:51" (1/1) ... [2024-11-07 07:21:52,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:51" (1/1) ... [2024-11-07 07:21:52,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:21:52,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:21:52,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:21:52,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:21:52,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:51" (1/1) ... [2024-11-07 07:21:52,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:21:52,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:21:52,106 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 07:21:52,109 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 07:21:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:21:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 07:21:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:21:52,127 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:21:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:21:52,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:21:52,226 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:21:52,228 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:22:00,368 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 07:22:00,368 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:22:00,379 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:22:00,380 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:22:00,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:22:00 BoogieIcfgContainer [2024-11-07 07:22:00,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:22:00,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:22:00,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:22:00,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:22:00,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:21:51" (1/3) ... [2024-11-07 07:22:00,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229cc5a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:22:00, skipping insertion in model container [2024-11-07 07:22:00,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:51" (2/3) ... [2024-11-07 07:22:00,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229cc5a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:22:00, skipping insertion in model container [2024-11-07 07:22:00,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:22:00" (3/3) ... [2024-11-07 07:22:00,391 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-97.i [2024-11-07 07:22:00,401 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:22:00,401 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:22:00,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:22:00,449 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;@508f3a29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:22:00,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:22:00,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 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 07:22:00,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 07:22:00,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:22:00,467 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, 1] [2024-11-07 07:22:00,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:22:00,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:22:00,471 INFO L85 PathProgramCache]: Analyzing trace with hash 49629536, now seen corresponding path program 1 times [2024-11-07 07:22:00,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:22:00,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207448226] [2024-11-07 07:22:00,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:22:00,481 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 07:22:00,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:22:00,487 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 07:22:00,488 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 07:22:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:22:00,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 07:22:00,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:22:01,102 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 07:22:01,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:22:01,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:22:01,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207448226] [2024-11-07 07:22:01,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207448226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:22:01,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:22:01,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:22:01,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437780705] [2024-11-07 07:22:01,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:22:01,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:22:01,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:22:01,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:22:01,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:22:01,156 INFO L87 Difference]: Start difference. First operand has 95 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 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 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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 07:22:01,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:22:01,179 INFO L93 Difference]: Finished difference Result 183 states and 327 transitions. [2024-11-07 07:22:01,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:22:01,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (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 208 [2024-11-07 07:22:01,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:22:01,188 INFO L225 Difference]: With dead ends: 183 [2024-11-07 07:22:01,188 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 07:22:01,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 207 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 07:22:01,194 INFO L432 NwaCegarLoop]: 142 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, 142 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 07:22:01,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:22:01,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 07:22:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 07:22:01,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 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 07:22:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2024-11-07 07:22:01,228 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 208 [2024-11-07 07:22:01,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:22:01,228 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2024-11-07 07:22:01,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (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 07:22:01,229 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2024-11-07 07:22:01,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 07:22:01,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:22:01,232 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, 1] [2024-11-07 07:22:01,246 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 07:22:01,434 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 07:22:01,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:22:01,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:22:01,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1998336558, now seen corresponding path program 1 times [2024-11-07 07:22:01,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:22:01,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39057818] [2024-11-07 07:22:01,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:22:01,442 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 07:22:01,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:22:01,444 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 07:22:01,452 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 07:22:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:22:01,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 07:22:01,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:22:03,754 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 07:22:03,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:22:03,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:22:03,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39057818] [2024-11-07 07:22:03,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39057818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:22:03,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:22:03,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:22:03,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502801117] [2024-11-07 07:22:03,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:22:03,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:22:03,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:22:03,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:22:03,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:22:03,760 INFO L87 Difference]: Start difference. First operand 91 states and 142 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 07:22:03,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:22:03,958 INFO L93 Difference]: Finished difference Result 263 states and 412 transitions. [2024-11-07 07:22:03,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:22:03,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 208 [2024-11-07 07:22:03,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:22:03,962 INFO L225 Difference]: With dead ends: 263 [2024-11-07 07:22:03,964 INFO L226 Difference]: Without dead ends: 175 [2024-11-07 07:22:03,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 206 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 07:22:03,966 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 33 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:22:03,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 260 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:22:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-07 07:22:03,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 165. [2024-11-07 07:22:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 96 states have internal predecessors, (122), 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 07:22:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 254 transitions. [2024-11-07 07:22:03,985 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 254 transitions. Word has length 208 [2024-11-07 07:22:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:22:03,986 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 254 transitions. [2024-11-07 07:22:03,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 07:22:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 254 transitions. [2024-11-07 07:22:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 07:22:03,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:22:03,988 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, 1] [2024-11-07 07:22:04,005 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 07:22:04,189 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 07:22:04,189 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:22:04,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:22:04,192 INFO L85 PathProgramCache]: Analyzing trace with hash 409988656, now seen corresponding path program 1 times [2024-11-07 07:22:04,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:22:04,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907489687] [2024-11-07 07:22:04,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:22:04,194 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 07:22:04,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:22:04,196 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 07:22:04,197 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 07:22:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:22:04,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 07:22:04,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:22:06,295 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 07:22:06,297 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:22:06,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:22:06,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907489687] [2024-11-07 07:22:06,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907489687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:22:06,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:22:06,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:22:06,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866811850] [2024-11-07 07:22:06,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:22:06,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:22:06,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:22:06,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:22:06,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:22:06,303 INFO L87 Difference]: Start difference. First operand 165 states and 254 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 07:22:06,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:22:06,462 INFO L93 Difference]: Finished difference Result 412 states and 634 transitions. [2024-11-07 07:22:06,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:22:06,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 208 [2024-11-07 07:22:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:22:06,466 INFO L225 Difference]: With dead ends: 412 [2024-11-07 07:22:06,466 INFO L226 Difference]: Without dead ends: 250 [2024-11-07 07:22:06,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 206 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 07:22:06,467 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 34 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:22:06,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 280 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:22:06,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-07 07:22:06,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2024-11-07 07:22:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 145 states have (on average 1.2620689655172415) internal successors, (183), 145 states have internal predecessors, (183), 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 07:22:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 381 transitions. [2024-11-07 07:22:06,536 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 381 transitions. Word has length 208 [2024-11-07 07:22:06,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:22:06,537 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 381 transitions. [2024-11-07 07:22:06,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 07:22:06,537 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 381 transitions. [2024-11-07 07:22:06,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 07:22:06,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:22:06,543 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, 1] [2024-11-07 07:22:06,570 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 07:22:06,743 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 07:22:06,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:22:06,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:22:06,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1431057010, now seen corresponding path program 1 times [2024-11-07 07:22:06,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:22:06,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389868086] [2024-11-07 07:22:06,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:22:06,746 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 07:22:06,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:22:06,749 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 07:22:06,750 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 07:22:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:22:07,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 07:22:07,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:22:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1082 proven. 51 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2024-11-07 07:22:08,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:22:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 45 proven. 51 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-07 07:22:09,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:22:09,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389868086] [2024-11-07 07:22:09,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389868086] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:22:09,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:22:09,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-07 07:22:09,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515736205] [2024-11-07 07:22:09,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:22:09,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:22:09,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:22:09,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:22:09,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:22:09,759 INFO L87 Difference]: Start difference. First operand 248 states and 381 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-07 07:22:11,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:22:11,110 INFO L93 Difference]: Finished difference Result 258 states and 389 transitions. [2024-11-07 07:22:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 07:22:11,111 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 208 [2024-11-07 07:22:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:22:11,113 INFO L225 Difference]: With dead ends: 258 [2024-11-07 07:22:11,113 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 07:22:11,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 408 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-07 07:22:11,117 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 154 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:22:11,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 188 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 07:22:11,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 07:22:11,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-11-07 07:22:11,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 07:22:11,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 133 transitions. [2024-11-07 07:22:11,129 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 133 transitions. Word has length 208 [2024-11-07 07:22:11,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:22:11,129 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 133 transitions. [2024-11-07 07:22:11,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-07 07:22:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 133 transitions. [2024-11-07 07:22:11,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 07:22:11,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:22:11,131 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, 1] [2024-11-07 07:22:11,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 07:22:11,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:22:11,336 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:22:11,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:22:11,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2132121588, now seen corresponding path program 1 times [2024-11-07 07:22:11,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:22:11,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363227020] [2024-11-07 07:22:11,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:22:11,338 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 07:22:11,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:22:11,340 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:22:11,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 07:22:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:22:11,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 07:22:11,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:22:12,543 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 07:22:12,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:22:12,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:22:12,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363227020] [2024-11-07 07:22:12,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363227020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:22:12,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:22:12,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:22:12,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452158661] [2024-11-07 07:22:12,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:22:12,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:22:12,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:22:12,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:22:12,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:22:12,545 INFO L87 Difference]: Start difference. First operand 92 states and 133 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 07:22:13,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:22:13,969 INFO L93 Difference]: Finished difference Result 254 states and 373 transitions. [2024-11-07 07:22:13,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:22:13,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 208 [2024-11-07 07:22:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:22:13,972 INFO L225 Difference]: With dead ends: 254 [2024-11-07 07:22:13,972 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 07:22:13,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:22:13,973 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 131 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:22:13,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 473 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 07:22:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 07:22:13,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 92. [2024-11-07 07:22:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 07:22:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2024-11-07 07:22:13,988 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 208 [2024-11-07 07:22:13,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:22:13,989 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2024-11-07 07:22:13,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 07:22:13,989 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2024-11-07 07:22:13,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-07 07:22:13,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:22:13,990 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, 1, 1] [2024-11-07 07:22:14,007 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 (6)] Ended with exit code 0 [2024-11-07 07:22:14,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 07:22:14,198 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:22:14,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:22:14,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1495602127, now seen corresponding path program 1 times [2024-11-07 07:22:14,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:22:14,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808254126] [2024-11-07 07:22:14,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:22:14,199 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 07:22:14,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:22:14,202 INFO L229 MonitoredProcess]: Starting monitored process 7 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 07:22:14,204 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 (7)] Waiting until timeout for monitored process [2024-11-07 07:22:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:22:14,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 07:22:14,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:22:18,112 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 07:22:18,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:22:18,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:22:18,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808254126] [2024-11-07 07:22:18,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808254126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:22:18,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:22:18,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:22:18,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239813905] [2024-11-07 07:22:18,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:22:18,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:22:18,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:22:18,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:22:18,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:22:18,115 INFO L87 Difference]: Start difference. First operand 92 states and 132 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 07:22:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:22:18,847 INFO L93 Difference]: Finished difference Result 277 states and 397 transitions. [2024-11-07 07:22:18,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:22:18,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 209 [2024-11-07 07:22:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:22:18,850 INFO L225 Difference]: With dead ends: 277 [2024-11-07 07:22:18,850 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 07:22:18,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:22:18,851 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 79 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 07:22:18,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 413 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 07:22:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 07:22:18,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 179. [2024-11-07 07:22:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 108 states have (on average 1.1759259259259258) internal successors, (127), 108 states have internal predecessors, (127), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 07:22:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 259 transitions. [2024-11-07 07:22:18,880 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 259 transitions. Word has length 209 [2024-11-07 07:22:18,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:22:18,880 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 259 transitions. [2024-11-07 07:22:18,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 07:22:18,881 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 259 transitions. [2024-11-07 07:22:18,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-07 07:22:18,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:22:18,882 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, 1, 1, 1] [2024-11-07 07:22:18,904 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 (7)] Ended with exit code 0 [2024-11-07 07:22:19,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 07:22:19,083 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:22:19,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:22:19,084 INFO L85 PathProgramCache]: Analyzing trace with hash 936323251, now seen corresponding path program 1 times [2024-11-07 07:22:19,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:22:19,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315653755] [2024-11-07 07:22:19,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:22:19,084 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 07:22:19,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:22:19,089 INFO L229 MonitoredProcess]: Starting monitored process 8 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 07:22:19,094 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 (8)] Waiting until timeout for monitored process [2024-11-07 07:22:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:22:19,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 07:22:19,490 INFO L278 TraceCheckSpWp]: Computing forward predicates...