./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-65.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_codestructure_dependencies_file-65.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', 'ac823ca5cc50fe08113211c1a95dfd9bb1053bd3689b9e5db62b1cf9eb37d385'] 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_codestructure_dependencies_file-65.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 ac823ca5cc50fe08113211c1a95dfd9bb1053bd3689b9e5db62b1cf9eb37d385 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:59:21,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:59:21,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 03:59:21,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:59:21,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:59:21,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:59:21,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:59:21,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:59:21,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:59:21,713 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:59:21,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:59:21,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:59:21,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:59:21,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:59:21,714 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:59:21,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:59:21,714 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:59:21,714 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 03:59:21,714 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:59:21,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 03:59:21,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:59:21,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:59:21,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:59:21,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:59:21,716 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:59:21,716 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 03:59:21,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:59:21,716 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:59:21,716 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:59:21,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:59:21,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:59:21,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:59:21,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:59:21,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:59:21,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:59:21,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:59:21,717 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:59:21,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:59:21,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:59:21,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:59:21,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:59:21,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:59:21,718 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 -> ac823ca5cc50fe08113211c1a95dfd9bb1053bd3689b9e5db62b1cf9eb37d385 [2024-11-07 03:59:21,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:59:21,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:59:21,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:59:21,963 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:59:21,963 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:59:21,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-65.i [2024-11-07 03:59:23,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:59:23,373 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:59:23,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-65.i [2024-11-07 03:59:23,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/149703826/98e9d4584ef24cd1921b75005c23c052/FLAGc4eec61c4 [2024-11-07 03:59:23,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/149703826/98e9d4584ef24cd1921b75005c23c052 [2024-11-07 03:59:23,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:59:23,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:59:23,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:59:23,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:59:23,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:59:23,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:59:23" (1/1) ... [2024-11-07 03:59:23,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20459f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:23, skipping insertion in model container [2024-11-07 03:59:23,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:59:23" (1/1) ... [2024-11-07 03:59:23,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:59:23,532 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_codestructure_dependencies_file-65.i[919,932] [2024-11-07 03:59:23,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:59:23,601 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:59:23,611 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_codestructure_dependencies_file-65.i[919,932] [2024-11-07 03:59:23,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:59:23,658 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:59:23,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:23 WrapperNode [2024-11-07 03:59:23,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:59:23,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:59:23,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:59:23,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:59:23,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:23" (1/1) ... [2024-11-07 03:59:23,677 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:23" (1/1) ... [2024-11-07 03:59:23,706 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-07 03:59:23,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:59:23,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:59:23,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:59:23,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:59:23,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:23" (1/1) ... [2024-11-07 03:59:23,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:23" (1/1) ... [2024-11-07 03:59:23,718 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:23" (1/1) ... [2024-11-07 03:59:23,729 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 03:59:23,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:23" (1/1) ... [2024-11-07 03:59:23,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:23" (1/1) ... [2024-11-07 03:59:23,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:23" (1/1) ... [2024-11-07 03:59:23,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:23" (1/1) ... [2024-11-07 03:59:23,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:23" (1/1) ... [2024-11-07 03:59:23,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:23" (1/1) ... [2024-11-07 03:59:23,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:59:23,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:59:23,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:59:23,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:59:23,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:23" (1/1) ... [2024-11-07 03:59:23,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:59:23,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:59:23,776 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 03:59:23,778 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 03:59:23,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:59:23,795 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 03:59:23,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 03:59:23,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:59:23,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:59:23,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:59:23,864 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:59:23,866 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:59:24,136 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-07 03:59:24,139 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:59:24,147 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:59:24,148 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:59:24,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:59:24 BoogieIcfgContainer [2024-11-07 03:59:24,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:59:24,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:59:24,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:59:24,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:59:24,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:59:23" (1/3) ... [2024-11-07 03:59:24,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4432b3b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:59:24, skipping insertion in model container [2024-11-07 03:59:24,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:23" (2/3) ... [2024-11-07 03:59:24,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4432b3b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:59:24, skipping insertion in model container [2024-11-07 03:59:24,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:59:24" (3/3) ... [2024-11-07 03:59:24,156 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-65.i [2024-11-07 03:59:24,169 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:59:24,169 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:59:24,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:59:24,226 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;@4283d79f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:59:24,227 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:59:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 03:59:24,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 03:59:24,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:59:24,241 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:24,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:59:24,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:59:24,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1863930504, now seen corresponding path program 1 times [2024-11-07 03:59:24,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:59:24,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005278275] [2024-11-07 03:59:24,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:24,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:59:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:59:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:59:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:59:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:59:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:59:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:59:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:59:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:59:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:59:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:59:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:59:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:59:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 03:59:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:59:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 03:59:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 03:59:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 03:59:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 03:59:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 03:59:24,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:59:24,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005278275] [2024-11-07 03:59:24,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005278275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:59:24,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:59:24,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:59:24,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288529085] [2024-11-07 03:59:24,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:59:24,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 03:59:24,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:59:24,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 03:59:24,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:59:24,571 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 03:59:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:59:24,592 INFO L93 Difference]: Finished difference Result 143 states and 240 transitions. [2024-11-07 03:59:24,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 03:59:24,594 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 122 [2024-11-07 03:59:24,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:59:24,598 INFO L225 Difference]: With dead ends: 143 [2024-11-07 03:59:24,598 INFO L226 Difference]: Without dead ends: 69 [2024-11-07 03:59:24,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 03:59:24,604 INFO L432 NwaCegarLoop]: 100 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, 100 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 03:59:24,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:59:24,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-07 03:59:24,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-07 03:59:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 03:59:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 100 transitions. [2024-11-07 03:59:24,639 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 100 transitions. Word has length 122 [2024-11-07 03:59:24,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:59:24,639 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 100 transitions. [2024-11-07 03:59:24,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 03:59:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 100 transitions. [2024-11-07 03:59:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 03:59:24,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:59:24,642 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:24,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:59:24,643 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:59:24,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:59:24,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1341826692, now seen corresponding path program 1 times [2024-11-07 03:59:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:59:24,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249994843] [2024-11-07 03:59:24,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:24,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:59:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:59:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:59:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:59:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:59:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:59:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:59:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:59:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:59:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:59:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:59:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:59:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:59:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 03:59:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:59:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 03:59:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 03:59:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 03:59:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 03:59:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 03:59:24,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:59:24,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249994843] [2024-11-07 03:59:24,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249994843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:59:24,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:59:24,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 03:59:24,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588576824] [2024-11-07 03:59:24,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:59:24,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 03:59:24,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:59:24,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 03:59:24,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 03:59:24,881 INFO L87 Difference]: Start difference. First operand 69 states and 100 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 03:59:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:59:24,928 INFO L93 Difference]: Finished difference Result 174 states and 256 transitions. [2024-11-07 03:59:24,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 03:59:24,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 122 [2024-11-07 03:59:24,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:59:24,933 INFO L225 Difference]: With dead ends: 174 [2024-11-07 03:59:24,933 INFO L226 Difference]: Without dead ends: 108 [2024-11-07 03:59:24,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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 03:59:24,934 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 89 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:59:24,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 203 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:59:24,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-07 03:59:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 69. [2024-11-07 03:59:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 03:59:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2024-11-07 03:59:24,942 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 96 transitions. Word has length 122 [2024-11-07 03:59:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:59:24,943 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 96 transitions. [2024-11-07 03:59:24,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 03:59:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 96 transitions. [2024-11-07 03:59:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 03:59:24,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:59:24,945 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:24,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:59:24,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:59:24,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:59:24,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1822591433, now seen corresponding path program 1 times [2024-11-07 03:59:24,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:59:24,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114553625] [2024-11-07 03:59:24,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:24,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:59:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:59:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:59:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:59:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:59:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:59:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:59:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:59:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:59:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:59:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:59:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:59:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:59:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 03:59:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:59:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 03:59:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 03:59:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 03:59:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 03:59:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,836 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 03:59:25,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:59:25,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114553625] [2024-11-07 03:59:25,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114553625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:59:25,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:59:25,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:59:25,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537922044] [2024-11-07 03:59:25,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:59:25,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:59:25,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:59:25,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:59:25,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:59:25,840 INFO L87 Difference]: Start difference. First operand 69 states and 96 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 03:59:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:59:26,118 INFO L93 Difference]: Finished difference Result 231 states and 329 transitions. [2024-11-07 03:59:26,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:59:26,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2024-11-07 03:59:26,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:59:26,121 INFO L225 Difference]: With dead ends: 231 [2024-11-07 03:59:26,121 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 03:59:26,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:59:26,122 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 214 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:59:26,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 573 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:59:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 03:59:26,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 71. [2024-11-07 03:59:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 03:59:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2024-11-07 03:59:26,139 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 98 transitions. Word has length 124 [2024-11-07 03:59:26,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:59:26,139 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 98 transitions. [2024-11-07 03:59:26,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 03:59:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 98 transitions. [2024-11-07 03:59:26,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 03:59:26,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:59:26,142 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:26,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:59:26,142 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:59:26,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:59:26,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1717026546, now seen corresponding path program 1 times [2024-11-07 03:59:26,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:59:26,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136051491] [2024-11-07 03:59:26,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:26,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:59:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:59:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:59:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:59:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:59:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:59:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:59:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:59:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:59:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:59:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:59:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:59:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:59:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 03:59:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:59:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 03:59:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 03:59:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 03:59:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 03:59:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 03:59:26,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:59:26,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136051491] [2024-11-07 03:59:26,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136051491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:59:26,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:59:26,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:59:26,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129745414] [2024-11-07 03:59:26,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:59:26,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:59:26,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:59:26,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:59:26,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:59:26,857 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-07 03:59:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:59:27,151 INFO L93 Difference]: Finished difference Result 168 states and 232 transitions. [2024-11-07 03:59:27,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:59:27,152 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 125 [2024-11-07 03:59:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:59:27,153 INFO L225 Difference]: With dead ends: 168 [2024-11-07 03:59:27,153 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 03:59:27,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 03:59:27,154 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 233 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:59:27,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 181 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:59:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 03:59:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-11-07 03:59:27,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 66 states have internal predecessors, (75), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 03:59:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 135 transitions. [2024-11-07 03:59:27,172 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 135 transitions. Word has length 125 [2024-11-07 03:59:27,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:59:27,172 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 135 transitions. [2024-11-07 03:59:27,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-07 03:59:27,172 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 135 transitions. [2024-11-07 03:59:27,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 03:59:27,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:59:27,174 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:27,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 03:59:27,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:59:27,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:59:27,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1036968176, now seen corresponding path program 1 times [2024-11-07 03:59:27,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:59:27,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091388708] [2024-11-07 03:59:27,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:27,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:59:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:59:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:59:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:59:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:59:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:59:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:59:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:59:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:59:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:59:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:59:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:59:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:59:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 03:59:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:59:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 03:59:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 03:59:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 03:59:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 03:59:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 03:59:27,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:59:27,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091388708] [2024-11-07 03:59:27,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091388708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:59:27,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:59:27,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:59:27,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542041252] [2024-11-07 03:59:27,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:59:27,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:59:27,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:59:27,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:59:27,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:59:27,843 INFO L87 Difference]: Start difference. First operand 99 states and 135 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 03:59:28,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:59:28,197 INFO L93 Difference]: Finished difference Result 261 states and 349 transitions. [2024-11-07 03:59:28,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:59:28,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2024-11-07 03:59:28,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:59:28,199 INFO L225 Difference]: With dead ends: 261 [2024-11-07 03:59:28,199 INFO L226 Difference]: Without dead ends: 185 [2024-11-07 03:59:28,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:59:28,200 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 213 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 03:59:28,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 543 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 03:59:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-07 03:59:28,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 114. [2024-11-07 03:59:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 72 states have (on average 1.125) internal successors, (81), 73 states have internal predecessors, (81), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 03:59:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 153 transitions. [2024-11-07 03:59:28,230 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 153 transitions. Word has length 125 [2024-11-07 03:59:28,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:59:28,230 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 153 transitions. [2024-11-07 03:59:28,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 03:59:28,230 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 153 transitions. [2024-11-07 03:59:28,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 03:59:28,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:59:28,231 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:28,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 03:59:28,232 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:59:28,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:59:28,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1472616063, now seen corresponding path program 1 times [2024-11-07 03:59:28,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:59:28,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844286934] [2024-11-07 03:59:28,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:28,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:59:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:59:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:59:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:59:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:59:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:59:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:59:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:59:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:59:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:59:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:59:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:59:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:59:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 03:59:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:59:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 03:59:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 03:59:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 03:59:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 03:59:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-07 03:59:28,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:59:28,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844286934] [2024-11-07 03:59:28,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844286934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 03:59:28,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543918352] [2024-11-07 03:59:28,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:28,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 03:59:28,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:59:28,506 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 03:59:28,508 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 03:59:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:28,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 03:59:28,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:59:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-07 03:59:28,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:59:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-07 03:59:28,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543918352] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 03:59:28,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 03:59:28,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-07 03:59:28,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548729385] [2024-11-07 03:59:28,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 03:59:28,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 03:59:28,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:59:28,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 03:59:28,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-07 03:59:28,963 INFO L87 Difference]: Start difference. First operand 114 states and 153 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-07 03:59:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:59:29,175 INFO L93 Difference]: Finished difference Result 204 states and 264 transitions. [2024-11-07 03:59:29,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 03:59:29,177 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 128 [2024-11-07 03:59:29,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:59:29,179 INFO L225 Difference]: With dead ends: 204 [2024-11-07 03:59:29,179 INFO L226 Difference]: Without dead ends: 130 [2024-11-07 03:59:29,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-07 03:59:29,179 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 180 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:59:29,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 189 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:59:29,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-07 03:59:29,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2024-11-07 03:59:29,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 78 states have (on average 1.1025641025641026) internal successors, (86), 79 states have internal predecessors, (86), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 03:59:29,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 158 transitions. [2024-11-07 03:59:29,202 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 158 transitions. Word has length 128 [2024-11-07 03:59:29,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:59:29,203 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 158 transitions. [2024-11-07 03:59:29,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-07 03:59:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2024-11-07 03:59:29,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 03:59:29,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:59:29,204 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:29,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 03:59:29,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 03:59:29,409 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:59:29,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:59:29,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1844113478, now seen corresponding path program 1 times [2024-11-07 03:59:29,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:59:29,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435741232] [2024-11-07 03:59:29,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:29,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:59:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:59:29,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:59:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:59:29,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 03:59:29,515 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:59:29,515 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:59:29,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 03:59:29,519 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:59:29,592 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:59:29,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:59:29 BoogieIcfgContainer [2024-11-07 03:59:29,595 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:59:29,596 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:59:29,596 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:59:29,596 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:59:29,597 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:59:24" (3/4) ... [2024-11-07 03:59:29,598 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 03:59:29,599 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:59:29,600 INFO L158 Benchmark]: Toolchain (without parser) took 6202.31ms. Allocated memory was 100.7MB in the beginning and 192.9MB in the end (delta: 92.3MB). Free memory was 76.4MB in the beginning and 110.9MB in the end (delta: -34.5MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. [2024-11-07 03:59:29,600 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 83.9MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:59:29,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.88ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 62.5MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:59:29,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.68ms. Allocated memory is still 100.7MB. Free memory was 62.4MB in the beginning and 59.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:59:29,602 INFO L158 Benchmark]: Boogie Preprocessor took 37.89ms. Allocated memory is still 100.7MB. Free memory was 59.6MB in the beginning and 56.2MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:59:29,602 INFO L158 Benchmark]: RCFGBuilder took 400.56ms. Allocated memory is still 100.7MB. Free memory was 56.2MB in the beginning and 73.3MB in the end (delta: -17.1MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-11-07 03:59:29,602 INFO L158 Benchmark]: TraceAbstraction took 5445.38ms. Allocated memory was 100.7MB in the beginning and 192.9MB in the end (delta: 92.3MB). Free memory was 72.4MB in the beginning and 111.0MB in the end (delta: -38.5MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2024-11-07 03:59:29,602 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 192.9MB. Free memory was 111.0MB in the beginning and 110.9MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:59:29,603 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.25ms. Allocated memory is still 83.9MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.88ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 62.5MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.68ms. Allocated memory is still 100.7MB. Free memory was 62.4MB in the beginning and 59.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.89ms. Allocated memory is still 100.7MB. Free memory was 59.6MB in the beginning and 56.2MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 400.56ms. Allocated memory is still 100.7MB. Free memory was 56.2MB in the beginning and 73.3MB in the end (delta: -17.1MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5445.38ms. Allocated memory was 100.7MB in the beginning and 192.9MB in the end (delta: 92.3MB). Free memory was 72.4MB in the beginning and 111.0MB in the end (delta: -38.5MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 192.9MB. Free memory was 111.0MB in the beginning and 110.9MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryArithmeticDOUBLEoperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_8 = 64; [L24] unsigned short int var_1_11 = 256; [L25] unsigned short int var_1_12 = 0; [L26] unsigned short int var_1_13 = 64; [L27] unsigned char var_1_14 = 1; [L28] unsigned char var_1_15 = 0; [L29] signed char var_1_16 = 50; [L30] signed char var_1_19 = -100; [L31] double var_1_20 = 100000000.8; [L32] double var_1_21 = 15.125; [L33] double var_1_22 = 99.22; [L34] signed long int var_1_23 = -16; [L35] unsigned char var_1_24 = 1; [L36] signed char var_1_25 = 10; [L37] signed char var_1_26 = 16; [L38] unsigned char var_1_27 = 0; [L39] double var_1_28 = 5.5; [L40] signed short int last_1_var_1_1 = 4; [L41] unsigned char last_1_var_1_14 = 1; [L42] signed char last_1_var_1_16 = 50; [L43] signed long int last_1_var_1_23 = -16; [L44] unsigned char last_1_var_1_24 = 1; [L45] double last_1_var_1_28 = 5.5; VAL [isInitial=0, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L115] last_1_var_1_1 = var_1_1 [L116] last_1_var_1_14 = var_1_14 [L117] last_1_var_1_16 = var_1_16 [L118] last_1_var_1_23 = var_1_23 [L119] last_1_var_1_24 = var_1_24 [L120] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L130] RET updateLastVariables() [L131] CALL updateVariables() [L85] var_1_11 = __VERIFIER_nondet_ushort() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L87] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L87] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L88] var_1_12 = __VERIFIER_nondet_ushort() [L89] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L89] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L90] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L90] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L91] var_1_13 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L92] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L93] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L93] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L95] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L96] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L96] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L97] var_1_19 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L98] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L99] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L99] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L100] var_1_21 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L101] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L102] var_1_22 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L103] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L104] var_1_25 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L105] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L106] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L106] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L107] var_1_26 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L108] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L109] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L109] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L110] var_1_27 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_8=64] [L111] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_8=64] [L112] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L112] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L131] RET updateVariables() [L132] CALL step() [L49] EXPR ((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L49] COND TRUE (((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23 [L50] var_1_23 = (5 - var_1_12) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-32762, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L54] COND FALSE !(last_1_var_1_23 < last_1_var_1_23) [L65] var_1_16 = 100 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-32762, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L67] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) [L68] var_1_28 = var_1_21 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_21=100000005, var_1_23=-32762, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L69] COND TRUE (var_1_23 <= var_1_23) || (var_1_23 > 4) [L70] var_1_1 = (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L74] var_1_24 = ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L75] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L75] COND TRUE var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16)) [L76] var_1_14 = (var_1_24 || var_1_15) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L78] COND TRUE \read(var_1_14) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L79] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L132] RET step() [L133] CALL, EXPR property() [L123] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L123] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L123] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L123] EXPR (((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1)))))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L123-L124] return (((((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1))))))) && (var_1_24 == ((unsigned char) ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 952 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 929 mSDsluCounter, 1789 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 928 mSDsCounter, 273 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 574 IncrementalHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 273 mSolverCounterUnsat, 861 mSDtfsCounter, 574 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 539 GetRequests, 502 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=6, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 213 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1003 NumberOfCodeBlocks, 1003 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 994 ConstructedInterpolants, 0 QuantifiedInterpolants, 2922 SizeOfPredicates, 2 NumberOfNonLiveVariables, 307 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 4797/4896 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 03:59:29,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-65.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 ac823ca5cc50fe08113211c1a95dfd9bb1053bd3689b9e5db62b1cf9eb37d385 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:59:31,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:59:31,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 03:59:31,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:59:31,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:59:31,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:59:31,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:59:31,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:59:31,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:59:31,617 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:59:31,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:59:31,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:59:31,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:59:31,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:59:31,618 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:59:31,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:59:31,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:59:31,618 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 03:59:31,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 03:59:31,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:59:31,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:59:31,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:59:31,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:59:31,621 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 03:59:31,621 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 03:59:31,621 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:59:31,621 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 03:59:31,621 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 03:59:31,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:59:31,621 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:59:31,621 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:59:31,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:59:31,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:59:31,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:59:31,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:59:31,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:59:31,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:59:31,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:59:31,622 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 03:59:31,622 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 03:59:31,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:59:31,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:59:31,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:59:31,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:59:31,622 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 -> ac823ca5cc50fe08113211c1a95dfd9bb1053bd3689b9e5db62b1cf9eb37d385 [2024-11-07 03:59:31,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:59:31,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:59:31,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:59:31,914 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:59:31,914 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:59:31,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-65.i [2024-11-07 03:59:33,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:59:33,325 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:59:33,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-65.i [2024-11-07 03:59:33,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5cf2bb817/be412febb7b0432d904965fd454d931b/FLAG173fa297e [2024-11-07 03:59:33,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5cf2bb817/be412febb7b0432d904965fd454d931b [2024-11-07 03:59:33,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:59:33,355 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:59:33,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:59:33,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:59:33,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:59:33,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:59:33" (1/1) ... [2024-11-07 03:59:33,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c834e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:33, skipping insertion in model container [2024-11-07 03:59:33,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:59:33" (1/1) ... [2024-11-07 03:59:33,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:59:33,493 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_codestructure_dependencies_file-65.i[919,932] [2024-11-07 03:59:33,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:59:33,560 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:59:33,570 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_codestructure_dependencies_file-65.i[919,932] [2024-11-07 03:59:33,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:59:33,619 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:59:33,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:33 WrapperNode [2024-11-07 03:59:33,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:59:33,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:59:33,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:59:33,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:59:33,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:33" (1/1) ... [2024-11-07 03:59:33,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:33" (1/1) ... [2024-11-07 03:59:33,666 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-07 03:59:33,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:59:33,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:59:33,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:59:33,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:59:33,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:33" (1/1) ... [2024-11-07 03:59:33,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:33" (1/1) ... [2024-11-07 03:59:33,678 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:33" (1/1) ... [2024-11-07 03:59:33,697 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 03:59:33,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:33" (1/1) ... [2024-11-07 03:59:33,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:33" (1/1) ... [2024-11-07 03:59:33,707 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:33" (1/1) ... [2024-11-07 03:59:33,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:33" (1/1) ... [2024-11-07 03:59:33,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:33" (1/1) ... [2024-11-07 03:59:33,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:33" (1/1) ... [2024-11-07 03:59:33,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:59:33,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:59:33,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:59:33,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:59:33,724 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:33" (1/1) ... [2024-11-07 03:59:33,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:59:33,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:59:33,755 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 03:59:33,757 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 03:59:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:59:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 03:59:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 03:59:33,775 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 03:59:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:59:33,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:59:33,844 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:59:33,846 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:59:34,802 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 03:59:34,802 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:59:34,810 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:59:34,811 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:59:34,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:59:34 BoogieIcfgContainer [2024-11-07 03:59:34,811 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:59:34,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:59:34,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:59:34,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:59:34,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:59:33" (1/3) ... [2024-11-07 03:59:34,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73557a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:59:34, skipping insertion in model container [2024-11-07 03:59:34,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:33" (2/3) ... [2024-11-07 03:59:34,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73557a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:59:34, skipping insertion in model container [2024-11-07 03:59:34,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:59:34" (3/3) ... [2024-11-07 03:59:34,818 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-65.i [2024-11-07 03:59:34,828 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:59:34,828 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:59:34,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:59:34,900 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;@2cd497e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:59:34,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:59:34,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 03:59:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 03:59:34,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:59:34,915 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:34,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:59:34,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:59:34,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1465341185, now seen corresponding path program 1 times [2024-11-07 03:59:34,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:59:34,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920025695] [2024-11-07 03:59:34,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:34,931 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 03:59:34,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:59:34,933 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 03:59:34,935 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 03:59:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:35,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 03:59:35,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:59:35,221 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-07 03:59:35,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:59:35,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:59:35,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920025695] [2024-11-07 03:59:35,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920025695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:59:35,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:59:35,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:59:35,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720590232] [2024-11-07 03:59:35,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:59:35,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 03:59:35,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:59:35,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 03:59:35,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:59:35,245 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 03:59:35,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:59:35,263 INFO L93 Difference]: Finished difference Result 105 states and 178 transitions. [2024-11-07 03:59:35,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 03:59:35,265 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2024-11-07 03:59:35,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:59:35,268 INFO L225 Difference]: With dead ends: 105 [2024-11-07 03:59:35,268 INFO L226 Difference]: Without dead ends: 51 [2024-11-07 03:59:35,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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 03:59:35,272 INFO L432 NwaCegarLoop]: 72 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, 72 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 03:59:35,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:59:35,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-07 03:59:35,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-07 03:59:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 03:59:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2024-11-07 03:59:35,307 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 116 [2024-11-07 03:59:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:59:35,307 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2024-11-07 03:59:35,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 03:59:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2024-11-07 03:59:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 03:59:35,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:59:35,310 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:35,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 03:59:35,511 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 03:59:35,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:59:35,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:59:35,512 INFO L85 PathProgramCache]: Analyzing trace with hash -769152005, now seen corresponding path program 1 times [2024-11-07 03:59:35,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:59:35,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018759677] [2024-11-07 03:59:35,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:35,513 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 03:59:35,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:59:35,515 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 03:59:35,516 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 03:59:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:35,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 03:59:35,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:59:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 03:59:36,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:59:36,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:59:36,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018759677] [2024-11-07 03:59:36,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018759677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:59:36,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:59:36,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 03:59:36,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090783311] [2024-11-07 03:59:36,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:59:36,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:59:36,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:59:36,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:59:36,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:59:36,982 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 03:59:38,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:59:38,521 INFO L93 Difference]: Finished difference Result 148 states and 211 transitions. [2024-11-07 03:59:38,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:59:38,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-07 03:59:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:59:38,537 INFO L225 Difference]: With dead ends: 148 [2024-11-07 03:59:38,537 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 03:59:38,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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 03:59:38,539 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 34 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 03:59:38,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 192 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 03:59:38,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 03:59:38,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 86. [2024-11-07 03:59:38,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 03:59:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2024-11-07 03:59:38,563 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 116 [2024-11-07 03:59:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:59:38,563 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2024-11-07 03:59:38,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 03:59:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2024-11-07 03:59:38,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 03:59:38,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:59:38,566 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:38,574 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 (3)] Forceful destruction successful, exit code 0 [2024-11-07 03:59:38,769 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 03:59:38,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:59:38,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:59:38,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1470216583, now seen corresponding path program 1 times [2024-11-07 03:59:38,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:59:38,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843128392] [2024-11-07 03:59:38,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:38,772 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 03:59:38,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:59:38,775 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 03:59:38,778 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 03:59:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:38,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 03:59:38,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:59:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 03:59:39,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:59:39,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:59:39,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843128392] [2024-11-07 03:59:39,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843128392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:59:39,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:59:39,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:59:39,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129499262] [2024-11-07 03:59:39,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:59:39,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 03:59:39,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:59:39,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 03:59:39,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 03:59:39,208 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 03:59:40,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:59:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:59:40,539 INFO L93 Difference]: Finished difference Result 182 states and 262 transitions. [2024-11-07 03:59:40,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 03:59:40,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-07 03:59:40,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:59:40,542 INFO L225 Difference]: With dead ends: 182 [2024-11-07 03:59:40,542 INFO L226 Difference]: Without dead ends: 134 [2024-11-07 03:59:40,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 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 03:59:40,543 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 03:59:40,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 140 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 03:59:40,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-07 03:59:40,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2024-11-07 03:59:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 74 states have internal predecessors, (83), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 03:59:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 191 transitions. [2024-11-07 03:59:40,574 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 191 transitions. Word has length 116 [2024-11-07 03:59:40,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:59:40,574 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 191 transitions. [2024-11-07 03:59:40,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 03:59:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 191 transitions. [2024-11-07 03:59:40,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 03:59:40,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:59:40,575 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:40,583 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 03:59:40,776 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 03:59:40,776 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:59:40,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:59:40,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1527474885, now seen corresponding path program 1 times [2024-11-07 03:59:40,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:59:40,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733258007] [2024-11-07 03:59:40,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:40,777 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 03:59:40,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:59:40,779 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 03:59:40,780 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 03:59:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:40,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 03:59:40,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:59:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-07 03:59:41,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:59:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-07 03:59:41,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:59:41,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733258007] [2024-11-07 03:59:41,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733258007] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 03:59:41,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 03:59:41,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-07 03:59:41,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937797829] [2024-11-07 03:59:41,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 03:59:41,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:59:41,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:59:41,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:59:41,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:59:41,308 INFO L87 Difference]: Start difference. First operand 132 states and 191 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-07 03:59:42,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:59:42,258 INFO L93 Difference]: Finished difference Result 200 states and 277 transitions. [2024-11-07 03:59:42,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 03:59:42,258 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 116 [2024-11-07 03:59:42,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:59:42,260 INFO L225 Difference]: With dead ends: 200 [2024-11-07 03:59:42,260 INFO L226 Difference]: Without dead ends: 152 [2024-11-07 03:59:42,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-07 03:59:42,262 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 127 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 03:59:42,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 126 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 03:59:42,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-07 03:59:42,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 94. [2024-11-07 03:59:42,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 03:59:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2024-11-07 03:59:42,281 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 116 [2024-11-07 03:59:42,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:59:42,282 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 129 transitions. [2024-11-07 03:59:42,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-07 03:59:42,282 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2024-11-07 03:59:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 03:59:42,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:59:42,283 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:42,291 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 03:59:42,483 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 03:59:42,484 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:59:42,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:59:42,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1432365903, now seen corresponding path program 1 times [2024-11-07 03:59:42,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:59:42,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774242399] [2024-11-07 03:59:42,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:42,484 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 03:59:42,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:59:42,486 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 03:59:42,487 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 03:59:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:42,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 03:59:42,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:59:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-07 03:59:42,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:59:42,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:59:42,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774242399] [2024-11-07 03:59:42,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774242399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:59:42,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:59:42,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:59:42,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717658670] [2024-11-07 03:59:42,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:59:42,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:59:42,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:59:42,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:59:42,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:59:42,732 INFO L87 Difference]: Start difference. First operand 94 states and 129 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 03:59:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:59:44,199 INFO L93 Difference]: Finished difference Result 168 states and 220 transitions. [2024-11-07 03:59:44,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 03:59:44,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2024-11-07 03:59:44,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:59:44,201 INFO L225 Difference]: With dead ends: 168 [2024-11-07 03:59:44,201 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 03:59:44,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-07 03:59:44,202 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 84 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 03:59:44,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 204 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 03:59:44,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 03:59:44,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2024-11-07 03:59:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 03:59:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2024-11-07 03:59:44,224 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 117 [2024-11-07 03:59:44,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:59:44,224 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 134 transitions. [2024-11-07 03:59:44,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 03:59:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2024-11-07 03:59:44,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 03:59:44,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:59:44,225 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:44,234 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 03:59:44,425 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 03:59:44,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:59:44,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:59:44,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1434212945, now seen corresponding path program 1 times [2024-11-07 03:59:44,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:59:44,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865065973] [2024-11-07 03:59:44,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:44,427 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 03:59:44,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:59:44,429 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 03:59:44,429 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 03:59:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:44,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 03:59:44,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:00:15,051 WARN L286 SmtUtils]: Spent 12.67s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-07 04:00:49,593 WARN L286 SmtUtils]: Spent 12.89s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)