./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-24.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_50-1loop_file-24.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', 'f8eec8e6962cf6cdbbc8bf030b667df75ae218fdfa7ef0f6b679cb7eca744d34'] 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_50-1loop_file-24.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 f8eec8e6962cf6cdbbc8bf030b667df75ae218fdfa7ef0f6b679cb7eca744d34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:39:53,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:39:53,757 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:39:53,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:39:53,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:39:53,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:39:53,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:39:53,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:39:53,795 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:39:53,795 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:39:53,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:39:53,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:39:53,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:39:53,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:39:53,796 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:39:53,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:39:53,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:39:53,796 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:39:53,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:39:53,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:39:53,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:39:53,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:39:53,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:39:53,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:39:53,797 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:39:53,797 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:39:53,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:39:53,798 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:39:53,798 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:39:53,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:39:53,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:39:53,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:39:53,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:39:53,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:39:53,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:39:53,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:39:53,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:39:53,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:39:53,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:39:53,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:39:53,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:39:53,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:39:53,800 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 -> f8eec8e6962cf6cdbbc8bf030b667df75ae218fdfa7ef0f6b679cb7eca744d34 [2024-11-07 08:39:54,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:39:54,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:39:54,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:39:54,097 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:39:54,097 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:39:54,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-24.i [2024-11-07 08:39:55,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:39:55,682 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:39:55,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-24.i [2024-11-07 08:39:55,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dbeacc198/4efcf6913fac4ff5baa98cd31570e466/FLAG27b375f82 [2024-11-07 08:39:55,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dbeacc198/4efcf6913fac4ff5baa98cd31570e466 [2024-11-07 08:39:55,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:39:55,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:39:55,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:39:55,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:39:55,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:39:55,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:39:55" (1/1) ... [2024-11-07 08:39:55,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@381ed248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:55, skipping insertion in model container [2024-11-07 08:39:55,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:39:55" (1/1) ... [2024-11-07 08:39:55,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:39:55,874 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_50-1loop_file-24.i[915,928] [2024-11-07 08:39:55,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:39:55,953 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:39:55,964 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_50-1loop_file-24.i[915,928] [2024-11-07 08:39:55,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:39:56,009 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:39:56,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:56 WrapperNode [2024-11-07 08:39:56,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:39:56,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:39:56,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:39:56,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:39:56,017 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:39:56" (1/1) ... [2024-11-07 08:39:56,024 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:39:56" (1/1) ... [2024-11-07 08:39:56,064 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-11-07 08:39:56,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:39:56,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:39:56,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:39:56,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:39:56,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:56" (1/1) ... [2024-11-07 08:39:56,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:56" (1/1) ... [2024-11-07 08:39:56,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:56" (1/1) ... [2024-11-07 08:39:56,108 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:39:56,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:56" (1/1) ... [2024-11-07 08:39:56,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:56" (1/1) ... [2024-11-07 08:39:56,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:56" (1/1) ... [2024-11-07 08:39:56,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:56" (1/1) ... [2024-11-07 08:39:56,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:56" (1/1) ... [2024-11-07 08:39:56,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:56" (1/1) ... [2024-11-07 08:39:56,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:39:56,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:39:56,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:39:56,141 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:39:56,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:56" (1/1) ... [2024-11-07 08:39:56,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:39:56,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:39:56,180 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:39:56,182 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:39:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:39:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:39:56,201 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:39:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:39:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:39:56,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:39:56,262 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:39:56,264 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:39:56,581 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 08:39:56,581 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:39:56,595 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:39:56,597 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:39:56,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:39:56 BoogieIcfgContainer [2024-11-07 08:39:56,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:39:56,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:39:56,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:39:56,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:39:56,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:39:55" (1/3) ... [2024-11-07 08:39:56,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35275ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:39:56, skipping insertion in model container [2024-11-07 08:39:56,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:39:56" (2/3) ... [2024-11-07 08:39:56,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35275ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:39:56, skipping insertion in model container [2024-11-07 08:39:56,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:39:56" (3/3) ... [2024-11-07 08:39:56,609 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-24.i [2024-11-07 08:39:56,622 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:39:56,622 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:39:56,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:39:56,686 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;@2ed46884, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:39:56,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:39:56,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 55 states have internal predecessors, (77), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 08:39:56,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 08:39:56,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:39:56,705 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:56,706 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:39:56,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:39:56,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1469957021, now seen corresponding path program 1 times [2024-11-07 08:39:56,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:39:56,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94261463] [2024-11-07 08:39:56,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:39:56,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:39:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:56,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:39:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:56,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 08:39:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:56,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 08:39:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:56,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 08:39:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:56,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:39:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:39:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:39:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:39:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:39:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:39:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 08:39:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 08:39:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 08:39:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:39:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 08:39:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:39:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 08:39:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:39:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 08:39:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:39:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 08:39:57,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:39:57,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94261463] [2024-11-07 08:39:57,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94261463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:39:57,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:39:57,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:39:57,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907114166] [2024-11-07 08:39:57,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:39:57,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:39:57,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:39:57,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:39:57,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:39:57,124 INFO L87 Difference]: Start difference. First operand has 77 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 55 states have internal predecessors, (77), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 08:39:57,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:39:57,146 INFO L93 Difference]: Finished difference Result 151 states and 251 transitions. [2024-11-07 08:39:57,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:39:57,149 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 131 [2024-11-07 08:39:57,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:39:57,155 INFO L225 Difference]: With dead ends: 151 [2024-11-07 08:39:57,155 INFO L226 Difference]: Without dead ends: 73 [2024-11-07 08:39:57,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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:39:57,161 INFO L432 NwaCegarLoop]: 114 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, 114 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:39:57,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:39:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-07 08:39:57,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-07 08:39:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 08:39:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 110 transitions. [2024-11-07 08:39:57,225 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 110 transitions. Word has length 131 [2024-11-07 08:39:57,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:39:57,226 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 110 transitions. [2024-11-07 08:39:57,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 08:39:57,226 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 110 transitions. [2024-11-07 08:39:57,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 08:39:57,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:39:57,233 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:57,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:39:57,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:39:57,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:39:57,234 INFO L85 PathProgramCache]: Analyzing trace with hash 907395811, now seen corresponding path program 1 times [2024-11-07 08:39:57,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:39:57,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072668834] [2024-11-07 08:39:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:39:57,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:39:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:39:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 08:39:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 08:39:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 08:39:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:39:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:39:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:39:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:39:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:39:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:39:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 08:39:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 08:39:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 08:39:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:39:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 08:39:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:39:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 08:39:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:39:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 08:39:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:39:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 08:39:57,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:39:57,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072668834] [2024-11-07 08:39:57,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072668834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:39:57,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:39:57,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:39:57,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210503302] [2024-11-07 08:39:57,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:39:57,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:39:57,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:39:57,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:39:57,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:39:57,819 INFO L87 Difference]: Start difference. First operand 73 states and 110 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 08:39:58,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:39:58,060 INFO L93 Difference]: Finished difference Result 244 states and 371 transitions. [2024-11-07 08:39:58,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:39:58,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-11-07 08:39:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:39:58,063 INFO L225 Difference]: With dead ends: 244 [2024-11-07 08:39:58,063 INFO L226 Difference]: Without dead ends: 174 [2024-11-07 08:39:58,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:39:58,064 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 117 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:39:58,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 333 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:39:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-07 08:39:58,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 141. [2024-11-07 08:39:58,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 98 states have internal predecessors, (135), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 08:39:58,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2024-11-07 08:39:58,102 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 131 [2024-11-07 08:39:58,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:39:58,102 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2024-11-07 08:39:58,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 08:39:58,102 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2024-11-07 08:39:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 08:39:58,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:39:58,107 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:58,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:39:58,107 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:39:58,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:39:58,108 INFO L85 PathProgramCache]: Analyzing trace with hash -79319162, now seen corresponding path program 1 times [2024-11-07 08:39:58,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:39:58,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819180078] [2024-11-07 08:39:58,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:39:58,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:39:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:39:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 08:39:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 08:39:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 08:39:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:39:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:39:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:39:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:39:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:39:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:39:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 08:39:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 08:39:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 08:39:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:39:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 08:39:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:39:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 08:39:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:39:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 08:39:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:39:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:39:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 08:39:58,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:39:58,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819180078] [2024-11-07 08:39:58,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819180078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:39:58,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:39:58,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 08:39:58,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652597474] [2024-11-07 08:39:58,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:39:58,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:39:58,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:39:58,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:39:58,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:39:58,673 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 08:39:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:39:59,087 INFO L93 Difference]: Finished difference Result 345 states and 510 transitions. [2024-11-07 08:39:59,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 08:39:59,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-11-07 08:39:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:39:59,091 INFO L225 Difference]: With dead ends: 345 [2024-11-07 08:39:59,091 INFO L226 Difference]: Without dead ends: 207 [2024-11-07 08:39:59,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-07 08:39:59,096 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 151 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:39:59,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 303 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:39:59,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-07 08:39:59,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 149. [2024-11-07 08:39:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 104 states have internal predecessors, (135), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 08:39:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 215 transitions. [2024-11-07 08:39:59,127 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 215 transitions. Word has length 132 [2024-11-07 08:39:59,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:39:59,128 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 215 transitions. [2024-11-07 08:39:59,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 08:39:59,129 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 215 transitions. [2024-11-07 08:39:59,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 08:39:59,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:39:59,131 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:59,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:39:59,131 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:39:59,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:39:59,132 INFO L85 PathProgramCache]: Analyzing trace with hash 621745416, now seen corresponding path program 1 times [2024-11-07 08:39:59,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:39:59,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995411261] [2024-11-07 08:39:59,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:39:59,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:39:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:39:59,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:39:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:39:59,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:39:59,366 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:39:59,367 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:39:59,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:39:59,371 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 08:39:59,482 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:39:59,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:39:59 BoogieIcfgContainer [2024-11-07 08:39:59,487 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:39:59,488 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:39:59,488 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:39:59,488 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:39:59,490 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:39:56" (3/4) ... [2024-11-07 08:39:59,491 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:39:59,493 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:39:59,494 INFO L158 Benchmark]: Toolchain (without parser) took 3778.10ms. Allocated memory is still 142.6MB. Free memory was 116.3MB in the beginning and 73.3MB in the end (delta: 43.0MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2024-11-07 08:39:59,494 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:39:59,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.75ms. Allocated memory is still 142.6MB. Free memory was 116.1MB in the beginning and 102.6MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:39:59,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.74ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 100.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:39:59,496 INFO L158 Benchmark]: Boogie Preprocessor took 74.31ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:39:59,496 INFO L158 Benchmark]: RCFGBuilder took 457.73ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 79.3MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:39:59,497 INFO L158 Benchmark]: TraceAbstraction took 2886.16ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 73.3MB in the end (delta: 5.4MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-07 08:39:59,497 INFO L158 Benchmark]: Witness Printer took 4.75ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 73.3MB in the end (delta: 51.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:39:59,500 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.28ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.75ms. Allocated memory is still 142.6MB. Free memory was 116.1MB in the beginning and 102.6MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.74ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 100.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 74.31ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 457.73ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 79.3MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2886.16ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 73.3MB in the end (delta: 5.4MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Witness Printer took 4.75ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 73.3MB in the end (delta: 51.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryArithmeticDOUBLEoperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 15.8; [L23] double var_1_4 = 10.5; [L24] double var_1_5 = 1.55; [L25] signed char var_1_8 = -10; [L26] signed char var_1_10 = -16; [L27] signed char var_1_11 = -4; [L28] signed char var_1_12 = -16; [L29] double var_1_13 = 128.55; [L30] double var_1_14 = 2.3; [L31] double var_1_15 = 4.8; [L32] unsigned long int var_1_16 = 0; [L33] signed long int var_1_17 = 5; [L34] signed long int var_1_18 = 256; [L35] unsigned long int var_1_19 = 50; [L36] unsigned long int var_1_20 = 1; [L37] signed short int var_1_21 = -50; [L38] unsigned char var_1_23 = 1; [L39] unsigned char var_1_24 = 0; [L40] signed char last_1_var_1_8 = -10; [L41] signed short int last_1_var_1_21 = -50; [L42] unsigned char last_1_var_1_23 = 1; VAL [isInitial=0, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_4=21/2, var_1_5=31/20, var_1_8=-10] [L137] isInitial = 1 [L138] FCALL initially() [L139] int k_loop; [L140] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_4=21/2, var_1_5=31/20, var_1_8=-10] [L140] COND TRUE k_loop < 1 [L141] CALL updateLastVariables() [L128] last_1_var_1_8 = var_1_8 [L129] last_1_var_1_21 = var_1_21 [L130] last_1_var_1_23 = var_1_23 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_4=21/2, var_1_5=31/20, var_1_8=-10] [L141] RET updateLastVariables() [L142] CALL updateVariables() [L94] var_1_4 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_5=31/20, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_5=31/20, var_1_8=-10] [L95] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_5=31/20, var_1_8=-10] [L96] var_1_5 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L97] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L98] var_1_10 = __VERIFIER_nondet_char() [L99] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L99] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L100] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L100] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L101] var_1_11 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_11 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L102] RET assume_abort_if_not(var_1_11 >= -31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L103] CALL assume_abort_if_not(var_1_11 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L103] RET assume_abort_if_not(var_1_11 <= 32) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L104] var_1_12 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L105] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L106] CALL assume_abort_if_not(var_1_12 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L106] RET assume_abort_if_not(var_1_12 <= 31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L107] var_1_14 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L108] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L109] var_1_15 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L110] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L111] var_1_17 = __VERIFIER_nondet_long() [L112] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L112] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L113] CALL assume_abort_if_not(var_1_17 <= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L113] RET assume_abort_if_not(var_1_17 <= 1073741824) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L114] var_1_18 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L115] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L116] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L116] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L117] var_1_19 = __VERIFIER_nondet_ulong() [L118] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L118] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L119] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L119] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L120] var_1_20 = __VERIFIER_nondet_ulong() [L121] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L121] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L122] CALL assume_abort_if_not(var_1_20 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=2147483647, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=2147483647, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L122] RET assume_abort_if_not(var_1_20 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=2147483647, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L123] var_1_24 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=2147483647, var_1_21=-50, var_1_23=1, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=2147483647, var_1_21=-50, var_1_23=1, var_1_8=-10] [L124] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=2147483647, var_1_21=-50, var_1_23=1, var_1_8=-10] [L125] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=2147483647, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=2147483647, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L125] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=2147483647, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L142] RET updateVariables() [L143] CALL step() [L46] COND TRUE last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=2147483647, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L47] COND TRUE \read(last_1_var_1_23) [L48] var_1_8 = (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=2147483647, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-40] [L53] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=2147483647, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-40] [L54] COND FALSE !(128u >= var_1_8) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=2147483647, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-40] [L61] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=0, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=2147483647, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-40] [L65] COND TRUE var_1_8 >= ((1329162249 - var_1_17) - var_1_18) [L66] var_1_16 = (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=2812064793, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=2147483647, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-40] [L74] COND FALSE !(((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=2812064793, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=2147483647, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-40] [L83] unsigned char stepLocal_1 = var_1_23; [L84] signed char stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, stepLocal_0=-40, stepLocal_1=0, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=2812064793, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_1=79/5, var_1_20=2147483647, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-40] [L85] COND TRUE stepLocal_0 >= var_1_16 [L86] var_1_1 = (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, stepLocal_1=0, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=2812064793, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_20=2147483647, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-40] [L143] RET step() [L144] CALL, EXPR property() [L133] EXPR (((((var_1_8 >= var_1_16) ? (var_1_1 == ((double) (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) : ((var_1_23 || var_1_23) ? (var_1_1 == ((double) 128.75)) : 1)) && ((last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8)))) ? (last_1_var_1_23 ? (var_1_8 == ((signed char) (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))))) : 1) : (var_1_8 == ((signed char) var_1_12)))) && ((128u >= var_1_8) ? ((! var_1_23) ? (var_1_13 == ((double) ((var_1_14 - var_1_15) + 0.25))) : (var_1_13 == ((double) var_1_14))) : (var_1_23 ? (var_1_13 == ((double) var_1_5)) : 1))) && ((var_1_8 >= ((1329162249 - var_1_17) - var_1_18)) ? (var_1_16 == ((unsigned long int) (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20))) : (var_1_23 ? (var_1_16 == ((unsigned long int) var_1_18)) : (var_1_16 == ((unsigned long int) var_1_19))))) && ((((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) ? ((var_1_11 >= (var_1_18 & var_1_16)) ? (var_1_21 == ((signed short int) 8)) : ((var_1_19 < var_1_8) ? (var_1_21 == ((signed short int) 64)) : 1)) : 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=2812064793, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_20=2147483647, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-40] [L133-L134] return ((((((var_1_8 >= var_1_16) ? (var_1_1 == ((double) (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) : ((var_1_23 || var_1_23) ? (var_1_1 == ((double) 128.75)) : 1)) && ((last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8)))) ? (last_1_var_1_23 ? (var_1_8 == ((signed char) (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))))) : 1) : (var_1_8 == ((signed char) var_1_12)))) && ((128u >= var_1_8) ? ((! var_1_23) ? (var_1_13 == ((double) ((var_1_14 - var_1_15) + 0.25))) : (var_1_13 == ((double) var_1_14))) : (var_1_23 ? (var_1_13 == ((double) var_1_5)) : 1))) && ((var_1_8 >= ((1329162249 - var_1_17) - var_1_18)) ? (var_1_16 == ((unsigned long int) (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20))) : (var_1_23 ? (var_1_16 == ((unsigned long int) var_1_18)) : (var_1_16 == ((unsigned long int) var_1_19))))) && ((((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) ? ((var_1_11 >= (var_1_18 & var_1_16)) ? (var_1_21 == ((signed short int) 8)) : ((var_1_19 < var_1_8) ? (var_1_21 == ((signed short int) 64)) : 1)) : 1)) && (var_1_23 == ((unsigned char) var_1_24)) ; [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=2812064793, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_20=2147483647, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-40] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=63, var_1_11=7, var_1_12=-31, var_1_13=2571/20, var_1_16=2812064793, var_1_17=664581146, var_1_18=664581143, var_1_19=664581146, var_1_20=2147483647, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=-40] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 268 mSDsluCounter, 750 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 381 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 313 IncrementalHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 369 mSDtfsCounter, 313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=3, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 91 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 526 NumberOfCodeBlocks, 526 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 391 ConstructedInterpolants, 0 QuantifiedInterpolants, 571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2280/2280 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:39:59,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-24.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 f8eec8e6962cf6cdbbc8bf030b667df75ae218fdfa7ef0f6b679cb7eca744d34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:40:01,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:40:01,854 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:40:01,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:40:01,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:40:01,893 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:40:01,894 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:40:01,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:40:01,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:40:01,895 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:40:01,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:40:01,896 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:40:01,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:40:01,896 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:40:01,897 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:40:01,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:40:01,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:40:01,897 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:40:01,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:40:01,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:40:01,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:40:01,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:40:01,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:40:01,897 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:40:01,897 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:40:01,897 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:40:01,897 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:40:01,897 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:40:01,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:40:01,897 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:40:01,898 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:40:01,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:40:01,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:40:01,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:40:01,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:40:01,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:40:01,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:40:01,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:40:01,899 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:40:01,899 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:40:01,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:40:01,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:40:01,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:40:01,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:40:01,900 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 -> f8eec8e6962cf6cdbbc8bf030b667df75ae218fdfa7ef0f6b679cb7eca744d34 [2024-11-07 08:40:02,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:40:02,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:40:02,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:40:02,223 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:40:02,223 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:40:02,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-24.i [2024-11-07 08:40:03,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:40:03,747 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:40:03,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-24.i [2024-11-07 08:40:03,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dca8d9a69/333b73a0d58d4302ae6e3c5b1b8bb398/FLAG4da6edb27 [2024-11-07 08:40:04,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dca8d9a69/333b73a0d58d4302ae6e3c5b1b8bb398 [2024-11-07 08:40:04,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:40:04,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:40:04,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:40:04,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:40:04,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:40:04,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:40:04" (1/1) ... [2024-11-07 08:40:04,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2931f702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:04, skipping insertion in model container [2024-11-07 08:40:04,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:40:04" (1/1) ... [2024-11-07 08:40:04,091 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:40:04,208 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_50-1loop_file-24.i[915,928] [2024-11-07 08:40:04,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:40:04,276 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:40:04,284 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_50-1loop_file-24.i[915,928] [2024-11-07 08:40:04,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:40:04,325 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:40:04,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:04 WrapperNode [2024-11-07 08:40:04,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:40:04,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:40:04,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:40:04,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:40:04,333 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:40:04" (1/1) ... [2024-11-07 08:40:04,344 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:40:04" (1/1) ... [2024-11-07 08:40:04,375 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-11-07 08:40:04,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:40:04,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:40:04,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:40:04,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:40:04,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:04" (1/1) ... [2024-11-07 08:40:04,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:04" (1/1) ... [2024-11-07 08:40:04,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:04" (1/1) ... [2024-11-07 08:40:04,417 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:40:04,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:04" (1/1) ... [2024-11-07 08:40:04,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:04" (1/1) ... [2024-11-07 08:40:04,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:04" (1/1) ... [2024-11-07 08:40:04,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:04" (1/1) ... [2024-11-07 08:40:04,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:04" (1/1) ... [2024-11-07 08:40:04,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:04" (1/1) ... [2024-11-07 08:40:04,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:40:04,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:40:04,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:40:04,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:40:04,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:04" (1/1) ... [2024-11-07 08:40:04,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:40:04,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:40:04,491 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:40:04,494 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:40:04,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:40:04,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:40:04,516 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:40:04,517 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:40:04,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:40:04,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:40:04,599 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:40:04,601 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:40:06,442 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-07 08:40:06,442 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:40:06,456 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:40:06,457 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:40:06,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:40:06 BoogieIcfgContainer [2024-11-07 08:40:06,457 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:40:06,460 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:40:06,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:40:06,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:40:06,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:40:04" (1/3) ... [2024-11-07 08:40:06,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d4199b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:40:06, skipping insertion in model container [2024-11-07 08:40:06,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:40:04" (2/3) ... [2024-11-07 08:40:06,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d4199b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:40:06, skipping insertion in model container [2024-11-07 08:40:06,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:40:06" (3/3) ... [2024-11-07 08:40:06,468 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-24.i [2024-11-07 08:40:06,493 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:40:06,493 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:40:06,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:40:06,547 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;@437bd988, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:40:06,548 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:40:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 08:40:06,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 08:40:06,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:40:06,563 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:06,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:40:06,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:40:06,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1320335106, now seen corresponding path program 1 times [2024-11-07 08:40:06,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:40:06,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855379572] [2024-11-07 08:40:06,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:40:06,575 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:40:06,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:40:06,579 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:40:06,580 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:40:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:40:06,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:40:06,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:40:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-07 08:40:06,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:40:06,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:40:06,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855379572] [2024-11-07 08:40:06,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855379572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:40:06,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:40:06,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:40:06,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723773765] [2024-11-07 08:40:06,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:40:06,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:40:06,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:40:06,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:40:06,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:40:06,978 INFO L87 Difference]: Start difference. First operand has 66 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 08:40:07,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:40:07,007 INFO L93 Difference]: Finished difference Result 129 states and 217 transitions. [2024-11-07 08:40:07,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:40:07,009 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2024-11-07 08:40:07,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:40:07,015 INFO L225 Difference]: With dead ends: 129 [2024-11-07 08:40:07,015 INFO L226 Difference]: Without dead ends: 62 [2024-11-07 08:40:07,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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:40:07,021 INFO L432 NwaCegarLoop]: 97 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, 97 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:40:07,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:40:07,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-07 08:40:07,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-07 08:40:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 08:40:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 93 transitions. [2024-11-07 08:40:07,068 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 93 transitions. Word has length 129 [2024-11-07 08:40:07,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:40:07,068 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 93 transitions. [2024-11-07 08:40:07,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 08:40:07,068 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 93 transitions. [2024-11-07 08:40:07,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 08:40:07,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:40:07,071 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:07,085 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:40:07,273 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:40:07,273 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:40:07,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:40:07,274 INFO L85 PathProgramCache]: Analyzing trace with hash 724594558, now seen corresponding path program 1 times [2024-11-07 08:40:07,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:40:07,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34733415] [2024-11-07 08:40:07,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:40:07,275 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:40:07,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:40:07,279 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:40:07,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 08:40:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:40:07,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 08:40:07,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:40:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 08:40:08,973 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:40:08,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:40:08,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34733415] [2024-11-07 08:40:08,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34733415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:40:08,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:40:08,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:40:08,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837572697] [2024-11-07 08:40:08,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:40:08,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:40:08,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:40:08,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:40:08,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:40:08,978 INFO L87 Difference]: Start difference. First operand 62 states and 93 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 08:40:10,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:40:11,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:40:11,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:40:11,746 INFO L93 Difference]: Finished difference Result 199 states and 301 transitions. [2024-11-07 08:40:11,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:40:11,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-07 08:40:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:40:11,770 INFO L225 Difference]: With dead ends: 199 [2024-11-07 08:40:11,770 INFO L226 Difference]: Without dead ends: 140 [2024-11-07 08:40:11,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:40:11,772 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 77 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 08:40:11,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 269 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 08:40:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-07 08:40:11,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 118. [2024-11-07 08:40:11,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 75 states have internal predecessors, (98), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 08:40:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 178 transitions. [2024-11-07 08:40:11,819 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 178 transitions. Word has length 129 [2024-11-07 08:40:11,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:40:11,821 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 178 transitions. [2024-11-07 08:40:11,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 08:40:11,821 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 178 transitions. [2024-11-07 08:40:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 08:40:11,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:40:11,823 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:11,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 08:40:12,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:40:12,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:40:12,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:40:12,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1474810271, now seen corresponding path program 1 times [2024-11-07 08:40:12,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:40:12,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532585217] [2024-11-07 08:40:12,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:40:12,025 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:40:12,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:40:12,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:40:12,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 08:40:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:40:12,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 08:40:12,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:40:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 08:40:12,470 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:40:12,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:40:12,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532585217] [2024-11-07 08:40:12,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532585217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:40:12,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:40:12,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 08:40:12,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861456512] [2024-11-07 08:40:12,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:40:12,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:40:12,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:40:12,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:40:12,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:40:12,472 INFO L87 Difference]: Start difference. First operand 118 states and 178 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 08:40:15,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:40:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:40:15,808 INFO L93 Difference]: Finished difference Result 299 states and 436 transitions. [2024-11-07 08:40:15,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 08:40:15,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2024-11-07 08:40:15,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:40:15,811 INFO L225 Difference]: With dead ends: 299 [2024-11-07 08:40:15,811 INFO L226 Difference]: Without dead ends: 184 [2024-11-07 08:40:15,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-07 08:40:15,813 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 117 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:40:15,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 253 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-07 08:40:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-07 08:40:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 126. [2024-11-07 08:40:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 08:40:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 179 transitions. [2024-11-07 08:40:15,851 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 179 transitions. Word has length 130 [2024-11-07 08:40:15,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:40:15,851 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 179 transitions. [2024-11-07 08:40:15,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 08:40:15,851 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 179 transitions. [2024-11-07 08:40:15,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 08:40:15,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:40:15,856 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:15,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-07 08:40:16,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:40:16,057 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:40:16,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:40:16,057 INFO L85 PathProgramCache]: Analyzing trace with hash -794751901, now seen corresponding path program 1 times [2024-11-07 08:40:16,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:40:16,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414254943] [2024-11-07 08:40:16,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:40:16,058 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:40:16,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:40:16,060 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:40:16,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 08:40:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:40:16,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 08:40:16,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:41:14,315 WARN L286 SmtUtils]: Spent 21.26s on a formula simplification that was a NOOP. DAG size: 116 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)