./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-97.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'af6837aab5604a8bd69642c61ca1f8ef68994640b44d7d7c2acb72ed2318df0c'] 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_loopvsstraightlinecode_25-while_file-97.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af6837aab5604a8bd69642c61ca1f8ef68994640b44d7d7c2acb72ed2318df0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:37:34,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:37:34,594 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:37:34,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:37:34,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:37:34,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:37:34,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:37:34,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:37:34,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:37:34,631 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:37:34,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:37:34,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:37:34,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:37:34,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:37:34,632 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:37:34,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:37:34,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:37:34,633 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:37:34,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:37:34,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:37:34,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:37:34,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:37:34,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:37:34,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:37:34,634 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:37:34,634 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:37:34,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:37:34,634 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:37:34,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:37:34,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:37:34,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:37:34,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:37:34,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:37:34,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:37:34,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:37:34,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:37:34,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:37:34,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:37:34,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:37:34,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:37:34,636 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:37:34,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:37:34,636 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 -> af6837aab5604a8bd69642c61ca1f8ef68994640b44d7d7c2acb72ed2318df0c [2024-11-07 08:37:34,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:37:34,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:37:34,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:37:34,905 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:37:34,905 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:37:34,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-97.i [2024-11-07 08:37:36,298 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:37:36,504 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:37:36,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-97.i [2024-11-07 08:37:36,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d555065f/7052af7b82944672a4dd70d2cd2658a2/FLAG511e5eb49 [2024-11-07 08:37:36,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d555065f/7052af7b82944672a4dd70d2cd2658a2 [2024-11-07 08:37:36,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:37:36,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:37:36,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:37:36,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:37:36,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:37:36,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:37:36" (1/1) ... [2024-11-07 08:37:36,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21079724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:36, skipping insertion in model container [2024-11-07 08:37:36,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:37:36" (1/1) ... [2024-11-07 08:37:36,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:37:36,677 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_loopvsstraightlinecode_25-while_file-97.i[915,928] [2024-11-07 08:37:36,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:37:36,720 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:37:36,730 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_loopvsstraightlinecode_25-while_file-97.i[915,928] [2024-11-07 08:37:36,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:37:36,759 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:37:36,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:36 WrapperNode [2024-11-07 08:37:36,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:37:36,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:37:36,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:37:36,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:37:36,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:36" (1/1) ... [2024-11-07 08:37:36,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:36" (1/1) ... [2024-11-07 08:37:36,815 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2024-11-07 08:37:36,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:37:36,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:37:36,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:37:36,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:37:36,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:36" (1/1) ... [2024-11-07 08:37:36,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:36" (1/1) ... [2024-11-07 08:37:36,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:36" (1/1) ... [2024-11-07 08:37:36,848 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 08:37:36,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:36" (1/1) ... [2024-11-07 08:37:36,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:36" (1/1) ... [2024-11-07 08:37:36,855 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:36" (1/1) ... [2024-11-07 08:37:36,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:36" (1/1) ... [2024-11-07 08:37:36,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:36" (1/1) ... [2024-11-07 08:37:36,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:36" (1/1) ... [2024-11-07 08:37:36,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:37:36,874 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:37:36,877 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:37:36,877 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:37:36,878 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:36" (1/1) ... [2024-11-07 08:37:36,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:37:36,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:37:36,914 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 08:37:36,918 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 08:37:36,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:37:36,941 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:37:36,941 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:37:36,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:37:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:37:36,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:37:37,021 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:37:37,024 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:37:37,294 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-07 08:37:37,294 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:37:37,307 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:37:37,308 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:37:37,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:37:37 BoogieIcfgContainer [2024-11-07 08:37:37,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:37:37,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:37:37,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:37:37,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:37:37,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:37:36" (1/3) ... [2024-11-07 08:37:37,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1c9028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:37:37, skipping insertion in model container [2024-11-07 08:37:37,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:36" (2/3) ... [2024-11-07 08:37:37,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1c9028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:37:37, skipping insertion in model container [2024-11-07 08:37:37,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:37:37" (3/3) ... [2024-11-07 08:37:37,319 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-97.i [2024-11-07 08:37:37,333 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:37:37,334 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:37:37,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:37:37,406 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;@e84e254, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:37:37,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:37:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:37:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 08:37:37,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:37:37,427 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:37:37,427 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:37:37,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:37:37,433 INFO L85 PathProgramCache]: Analyzing trace with hash -615160373, now seen corresponding path program 1 times [2024-11-07 08:37:37,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:37:37,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710824179] [2024-11-07 08:37:37,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:37:37,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:37:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:37,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:37:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:37,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:37:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:37,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:37:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:37,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:37:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:37,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:37:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:37,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:37:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:37,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:37:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:37,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:37:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:37,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:37:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:37,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:37:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:37,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:37:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:37,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:37:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:37,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:37:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:37,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:37:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:37,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:37:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:37,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:37:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:37:37,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:37:37,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710824179] [2024-11-07 08:37:37,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710824179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:37:37,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:37:37,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:37:37,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046261356] [2024-11-07 08:37:37,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:37:37,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:37:37,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:37:37,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:37:37,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:37:37,848 INFO L87 Difference]: Start difference. First operand has 61 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:37:37,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:37:37,874 INFO L93 Difference]: Finished difference Result 114 states and 190 transitions. [2024-11-07 08:37:37,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:37:37,876 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2024-11-07 08:37:37,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:37:37,883 INFO L225 Difference]: With dead ends: 114 [2024-11-07 08:37:37,883 INFO L226 Difference]: Without dead ends: 56 [2024-11-07 08:37:37,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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 08:37:37,890 INFO L432 NwaCegarLoop]: 81 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, 81 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 08:37:37,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:37:37,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-07 08:37:37,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-07 08:37:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:37:37,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2024-11-07 08:37:37,929 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 103 [2024-11-07 08:37:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:37:37,930 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2024-11-07 08:37:37,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:37:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2024-11-07 08:37:37,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 08:37:37,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:37:37,936 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:37:37,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:37:37,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:37:37,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:37:37,937 INFO L85 PathProgramCache]: Analyzing trace with hash 929365903, now seen corresponding path program 1 times [2024-11-07 08:37:37,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:37:37,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54079175] [2024-11-07 08:37:37,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:37:37,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:37:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:38,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:37:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:38,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:37:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:38,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:37:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:38,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:37:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:38,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:37:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:38,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:37:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:38,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:37:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:38,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:37:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:38,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:37:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:38,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:37:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:38,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:37:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:38,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:37:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:38,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:37:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:38,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:37:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:38,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:37:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:38,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:37:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:37:38,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:37:38,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54079175] [2024-11-07 08:37:38,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54079175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:37:38,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:37:38,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 08:37:38,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394147027] [2024-11-07 08:37:38,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:37:38,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:37:38,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:37:38,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:37:38,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:37:38,630 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:37:38,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:37:38,724 INFO L93 Difference]: Finished difference Result 131 states and 190 transitions. [2024-11-07 08:37:38,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:37:38,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2024-11-07 08:37:38,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:37:38,726 INFO L225 Difference]: With dead ends: 131 [2024-11-07 08:37:38,726 INFO L226 Difference]: Without dead ends: 78 [2024-11-07 08:37:38,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:37:38,728 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 27 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:37:38,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 405 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:37:38,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-07 08:37:38,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2024-11-07 08:37:38,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:37:38,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2024-11-07 08:37:38,742 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 103 [2024-11-07 08:37:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:37:38,745 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2024-11-07 08:37:38,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:37:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2024-11-07 08:37:38,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 08:37:38,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:37:38,748 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:37:38,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:37:38,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:37:38,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:37:38,749 INFO L85 PathProgramCache]: Analyzing trace with hash -138577346, now seen corresponding path program 1 times [2024-11-07 08:37:38,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:37:38,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297437545] [2024-11-07 08:37:38,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:37:38,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:37:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:39,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:37:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:39,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:37:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:39,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:37:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:39,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:37:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:39,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:37:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:39,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:37:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:39,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:37:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:39,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:37:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:39,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:37:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:39,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:37:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:39,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:37:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:39,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:37:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:39,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:37:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:39,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:37:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:39,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:37:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:39,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:37:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:37:39,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:37:39,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297437545] [2024-11-07 08:37:39,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297437545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:37:39,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:37:39,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 08:37:39,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969499583] [2024-11-07 08:37:39,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:37:39,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:37:39,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:37:39,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:37:39,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:37:39,135 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:37:39,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:37:39,280 INFO L93 Difference]: Finished difference Result 141 states and 204 transitions. [2024-11-07 08:37:39,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:37:39,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-11-07 08:37:39,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:37:39,285 INFO L225 Difference]: With dead ends: 141 [2024-11-07 08:37:39,285 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 08:37:39,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:37:39,286 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 48 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:37:39,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 429 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:37:39,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 08:37:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2024-11-07 08:37:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:37:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2024-11-07 08:37:39,296 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 104 [2024-11-07 08:37:39,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:37:39,297 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2024-11-07 08:37:39,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 08:37:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2024-11-07 08:37:39,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 08:37:39,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:37:39,299 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:37:39,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:37:39,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:37:39,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:37:39,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1110287530, now seen corresponding path program 1 times [2024-11-07 08:37:39,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:37:39,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830452954] [2024-11-07 08:37:39,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:37:39,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:37:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:37:39,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:37:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:37:39,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:37:39,487 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:37:39,488 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:37:39,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:37:39,492 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 08:37:39,579 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:37:39,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:37:39 BoogieIcfgContainer [2024-11-07 08:37:39,583 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:37:39,583 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:37:39,583 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:37:39,584 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:37:39,585 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:37:37" (3/4) ... [2024-11-07 08:37:39,587 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:37:39,588 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:37:39,589 INFO L158 Benchmark]: Toolchain (without parser) took 3053.90ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 91.7MB in the beginning and 81.4MB in the end (delta: 10.3MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2024-11-07 08:37:39,592 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:37:39,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.33ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 79.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:37:39,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.22ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 77.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:37:39,593 INFO L158 Benchmark]: Boogie Preprocessor took 57.13ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 75.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:37:39,593 INFO L158 Benchmark]: RCFGBuilder took 434.67ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 60.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:37:39,593 INFO L158 Benchmark]: TraceAbstraction took 2271.89ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 59.9MB in the beginning and 82.3MB in the end (delta: -22.4MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2024-11-07 08:37:39,594 INFO L158 Benchmark]: Witness Printer took 5.00ms. Allocated memory is still 159.4MB. Free memory was 82.3MB in the beginning and 81.4MB in the end (delta: 939.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:37:39,597 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.18ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.33ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 79.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.22ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 77.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.13ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 75.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 434.67ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 60.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2271.89ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 59.9MB in the beginning and 82.3MB in the end (delta: -22.4MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Witness Printer took 5.00ms. Allocated memory is still 159.4MB. Free memory was 82.3MB in the beginning and 81.4MB in the end (delta: 939.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryArithmeticFLOAToperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_6 = 1; [L25] signed short int var_1_7 = 32; [L26] signed short int var_1_8 = 20113; [L27] signed short int var_1_9 = 100; [L28] signed char var_1_10 = 100; [L29] signed char var_1_11 = -1; [L30] signed char var_1_12 = 16; [L31] float var_1_13 = 1.2; [L32] float var_1_14 = 3.6; [L33] float var_1_15 = 5.5; [L34] signed char last_1_var_1_10 = 100; VAL [isInitial=0, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=1, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L90] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=1, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L100] RET updateLastVariables() [L101] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L66] var_1_6 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_7=32, var_1_8=20113, var_1_9=100] [L67] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_7=32, var_1_8=20113, var_1_9=100] [L68] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L68] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L69] var_1_7 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L70] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L71] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L71] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L73] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L74] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L74] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L78] var_1_11 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L79] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L80] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L81] var_1_12 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L82] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L83] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L84] var_1_14 = __VERIFIER_nondet_float() [L85] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L85] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L86] var_1_15 = __VERIFIER_nondet_float() [L87] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L87] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L101] RET updateVariables() [L102] CALL step() [L38] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L49] COND TRUE var_1_1 == var_1_7 [L50] var_1_10 = (var_1_11 + (var_1_12 + -25)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L56] COND TRUE \read(var_1_6) [L57] var_1_13 = ((((16.3f) < ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f))))) ? (16.3f) : ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f)))))) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=163/10, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L102] RET step() [L103] CALL, EXPR property() [L93] EXPR (var_1_2 ? ((last_1_var_1_10 > last_1_var_1_10) ? (var_1_6 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) last_1_var_1_10))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=163/10, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L93] EXPR (var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=163/10, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L93] EXPR (var_1_2 ? ((last_1_var_1_10 > last_1_var_1_10) ? (var_1_6 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) last_1_var_1_10))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=163/10, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L93-L94] return ((var_1_2 ? ((last_1_var_1_10 > last_1_var_1_10) ? (var_1_6 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) last_1_var_1_10))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1))) && (var_1_6 ? (var_1_13 == ((float) ((((16.3f) < ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f))))) ? (16.3f) : ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f)))))))) : (var_1_13 == ((float) (var_1_14 - var_1_15)))) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=163/10, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=163/10, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 915 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 653 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 262 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=3, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 307 ConstructedInterpolants, 0 QuantifiedInterpolants, 363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1440/1440 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 08:37:39,629 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_loopvsstraightlinecode_25-while_file-97.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af6837aab5604a8bd69642c61ca1f8ef68994640b44d7d7c2acb72ed2318df0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:37:41,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:37:41,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:37:41,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:37:41,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:37:41,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:37:41,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:37:41,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:37:41,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:37:41,938 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:37:41,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:37:41,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:37:41,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:37:41,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:37:41,938 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:37:41,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:37:41,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:37:41,938 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:37:41,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:37:41,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:37:41,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:37:41,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:37:41,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:37:41,939 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:37:41,939 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:37:41,939 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:37:41,939 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:37:41,939 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:37:41,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:37:41,939 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:37:41,939 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:37:41,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:37:41,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:37:41,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:37:41,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:37:41,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:37:41,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:37:41,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:37:41,940 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:37:41,940 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:37:41,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:37:41,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:37:41,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:37:41,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:37:41,941 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 -> af6837aab5604a8bd69642c61ca1f8ef68994640b44d7d7c2acb72ed2318df0c [2024-11-07 08:37:42,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:37:42,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:37:42,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:37:42,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:37:42,263 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:37:42,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-97.i [2024-11-07 08:37:43,641 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:37:43,891 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:37:43,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-97.i [2024-11-07 08:37:43,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9bf376cdc/01dbf396004e45c38e25a7503ffabc96/FLAGe7509dc6e [2024-11-07 08:37:43,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9bf376cdc/01dbf396004e45c38e25a7503ffabc96 [2024-11-07 08:37:43,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:37:43,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:37:43,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:37:43,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:37:43,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:37:43,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:37:43" (1/1) ... [2024-11-07 08:37:43,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443132f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:43, skipping insertion in model container [2024-11-07 08:37:43,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:37:43" (1/1) ... [2024-11-07 08:37:43,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:37:44,084 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_loopvsstraightlinecode_25-while_file-97.i[915,928] [2024-11-07 08:37:44,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:37:44,160 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:37:44,172 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_loopvsstraightlinecode_25-while_file-97.i[915,928] [2024-11-07 08:37:44,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:37:44,212 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:37:44,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:44 WrapperNode [2024-11-07 08:37:44,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:37:44,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:37:44,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:37:44,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:37:44,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:44" (1/1) ... [2024-11-07 08:37:44,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:44" (1/1) ... [2024-11-07 08:37:44,264 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-11-07 08:37:44,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:37:44,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:37:44,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:37:44,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:37:44,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:44" (1/1) ... [2024-11-07 08:37:44,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:44" (1/1) ... [2024-11-07 08:37:44,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:44" (1/1) ... [2024-11-07 08:37:44,297 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 08:37:44,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:44" (1/1) ... [2024-11-07 08:37:44,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:44" (1/1) ... [2024-11-07 08:37:44,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:44" (1/1) ... [2024-11-07 08:37:44,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:44" (1/1) ... [2024-11-07 08:37:44,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:44" (1/1) ... [2024-11-07 08:37:44,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:44" (1/1) ... [2024-11-07 08:37:44,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:37:44,334 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:37:44,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:37:44,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:37:44,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:44" (1/1) ... [2024-11-07 08:37:44,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:37:44,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:37:44,374 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 08:37:44,381 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 08:37:44,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:37:44,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:37:44,403 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:37:44,403 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:37:44,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:37:44,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:37:44,486 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:37:44,488 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:37:44,902 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 08:37:44,902 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:37:44,915 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:37:44,915 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:37:44,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:37:44 BoogieIcfgContainer [2024-11-07 08:37:44,917 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:37:44,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:37:44,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:37:44,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:37:44,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:37:43" (1/3) ... [2024-11-07 08:37:44,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18dba652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:37:44, skipping insertion in model container [2024-11-07 08:37:44,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:44" (2/3) ... [2024-11-07 08:37:44,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18dba652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:37:44, skipping insertion in model container [2024-11-07 08:37:44,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:37:44" (3/3) ... [2024-11-07 08:37:44,929 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-97.i [2024-11-07 08:37:44,943 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:37:44,944 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:37:44,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:37:45,008 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;@340d4777, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:37:45,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:37:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:37:45,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 08:37:45,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:37:45,021 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:37:45,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:37:45,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:37:45,026 INFO L85 PathProgramCache]: Analyzing trace with hash -485837608, now seen corresponding path program 1 times [2024-11-07 08:37:45,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:37:45,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194053474] [2024-11-07 08:37:45,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:37:45,040 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 08:37:45,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:37:45,044 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 08:37:45,046 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 08:37:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:45,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:37:45,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:37:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-07 08:37:45,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:37:45,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:37:45,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194053474] [2024-11-07 08:37:45,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194053474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:37:45,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:37:45,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:37:45,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977988721] [2024-11-07 08:37:45,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:37:45,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:37:45,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:37:45,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:37:45,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:37:45,348 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:37:45,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:37:45,374 INFO L93 Difference]: Finished difference Result 92 states and 156 transitions. [2024-11-07 08:37:45,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:37:45,376 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2024-11-07 08:37:45,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:37:45,382 INFO L225 Difference]: With dead ends: 92 [2024-11-07 08:37:45,382 INFO L226 Difference]: Without dead ends: 45 [2024-11-07 08:37:45,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 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 08:37:45,389 INFO L432 NwaCegarLoop]: 64 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, 64 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 08:37:45,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:37:45,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-07 08:37:45,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-07 08:37:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:37:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2024-11-07 08:37:45,443 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 101 [2024-11-07 08:37:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:37:45,444 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2024-11-07 08:37:45,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:37:45,444 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2024-11-07 08:37:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 08:37:45,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:37:45,448 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:37:45,458 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 08:37:45,648 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 08:37:45,649 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:37:45,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:37:45,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1862135708, now seen corresponding path program 1 times [2024-11-07 08:37:45,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:37:45,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428694125] [2024-11-07 08:37:45,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:37:45,651 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 08:37:45,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:37:45,655 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 08:37:45,656 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 08:37:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:45,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 08:37:45,867 INFO L278 TraceCheckSpWp]: Computing forward predicates...