./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-6.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_operatoramount_amount50_file-6.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', '4702cea995123cc0372f2a641d4c48ccedf5de741e36ed596af4925d0c7d899c'] 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_operatoramount_amount50_file-6.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 4702cea995123cc0372f2a641d4c48ccedf5de741e36ed596af4925d0c7d899c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:52:39,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:52:39,766 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 09:52:39,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:52:39,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:52:39,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:52:39,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:52:39,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:52:39,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:52:39,785 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:52:39,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:52:39,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:52:39,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:52:39,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:52:39,786 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:52:39,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:52:39,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:52:39,786 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:52:39,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:52:39,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:52:39,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:52:39,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:52:39,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:52:39,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:52:39,787 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:52:39,787 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:52:39,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:52:39,787 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:52:39,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:52:39,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:52:39,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:52:39,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:52:39,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:52:39,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:52:39,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:52:39,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:52:39,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:52:39,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:52:39,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:52:39,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:52:39,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:52:39,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:52:39,789 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 -> 4702cea995123cc0372f2a641d4c48ccedf5de741e36ed596af4925d0c7d899c [2024-11-07 09:52:39,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:52:39,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:52:39,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:52:39,997 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:52:39,997 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:52:39,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-6.i [2024-11-07 09:52:41,176 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:52:41,398 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:52:41,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-6.i [2024-11-07 09:52:41,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34cb087fe/00fd2501b262453bb14f64f51d913545/FLAG042d1d7e5 [2024-11-07 09:52:41,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34cb087fe/00fd2501b262453bb14f64f51d913545 [2024-11-07 09:52:41,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:52:41,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:52:41,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:52:41,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:52:41,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:52:41,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:52:41" (1/1) ... [2024-11-07 09:52:41,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fcea122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:41, skipping insertion in model container [2024-11-07 09:52:41,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:52:41" (1/1) ... [2024-11-07 09:52:41,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:52:41,541 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_operatoramount_amount50_file-6.i[914,927] [2024-11-07 09:52:41,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:52:41,587 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:52:41,595 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_operatoramount_amount50_file-6.i[914,927] [2024-11-07 09:52:41,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:52:41,622 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:52:41,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:41 WrapperNode [2024-11-07 09:52:41,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:52:41,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:52:41,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:52:41,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:52:41,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:41" (1/1) ... [2024-11-07 09:52:41,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:41" (1/1) ... [2024-11-07 09:52:41,662 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2024-11-07 09:52:41,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:52:41,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:52:41,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:52:41,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:52:41,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:41" (1/1) ... [2024-11-07 09:52:41,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:41" (1/1) ... [2024-11-07 09:52:41,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:41" (1/1) ... [2024-11-07 09:52:41,686 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 09:52:41,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:41" (1/1) ... [2024-11-07 09:52:41,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:41" (1/1) ... [2024-11-07 09:52:41,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:41" (1/1) ... [2024-11-07 09:52:41,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:41" (1/1) ... [2024-11-07 09:52:41,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:41" (1/1) ... [2024-11-07 09:52:41,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:41" (1/1) ... [2024-11-07 09:52:41,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:52:41,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:52:41,705 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:52:41,705 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:52:41,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:41" (1/1) ... [2024-11-07 09:52:41,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:52:41,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:52:41,730 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 09:52:41,732 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 09:52:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:52:41,750 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:52:41,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:52:41,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:52:41,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:52:41,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:52:41,811 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:52:41,813 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:52:42,019 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 09:52:42,019 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:52:42,026 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:52:42,026 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:52:42,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:52:42 BoogieIcfgContainer [2024-11-07 09:52:42,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:52:42,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:52:42,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:52:42,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:52:42,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:52:41" (1/3) ... [2024-11-07 09:52:42,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2418ba77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:52:42, skipping insertion in model container [2024-11-07 09:52:42,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:41" (2/3) ... [2024-11-07 09:52:42,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2418ba77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:52:42, skipping insertion in model container [2024-11-07 09:52:42,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:52:42" (3/3) ... [2024-11-07 09:52:42,034 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-6.i [2024-11-07 09:52:42,044 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:52:42,044 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:52:42,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:52:42,096 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;@1ae1d2a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:52:42,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:52:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 09:52:42,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 09:52:42,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:52:42,107 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:52:42,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:52:42,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:52:42,112 INFO L85 PathProgramCache]: Analyzing trace with hash -575662562, now seen corresponding path program 1 times [2024-11-07 09:52:42,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:52:42,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357634089] [2024-11-07 09:52:42,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:52:42,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:52:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:52:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 09:52:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 09:52:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 09:52:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:52:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 09:52:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 09:52:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 09:52:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 09:52:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 09:52:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 09:52:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 09:52:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 09:52:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:52:42,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:52:42,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357634089] [2024-11-07 09:52:42,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357634089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:52:42,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:52:42,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:52:42,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816333511] [2024-11-07 09:52:42,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:52:42,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:52:42,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:52:42,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:52:42,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:52:42,349 INFO L87 Difference]: Start difference. First operand has 54 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 09:52:42,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:52:42,367 INFO L93 Difference]: Finished difference Result 101 states and 163 transitions. [2024-11-07 09:52:42,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:52:42,369 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 92 [2024-11-07 09:52:42,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:52:42,373 INFO L225 Difference]: With dead ends: 101 [2024-11-07 09:52:42,373 INFO L226 Difference]: Without dead ends: 50 [2024-11-07 09:52:42,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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 09:52:42,377 INFO L432 NwaCegarLoop]: 71 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, 71 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 09:52:42,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:52:42,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-07 09:52:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-07 09:52:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 09:52:42,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2024-11-07 09:52:42,405 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 92 [2024-11-07 09:52:42,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:52:42,405 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2024-11-07 09:52:42,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 09:52:42,405 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2024-11-07 09:52:42,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 09:52:42,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:52:42,409 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:52:42,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:52:42,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:52:42,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:52:42,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1093888672, now seen corresponding path program 1 times [2024-11-07 09:52:42,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:52:42,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466319380] [2024-11-07 09:52:42,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:52:42,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:52:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:52:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 09:52:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 09:52:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 09:52:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:52:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 09:52:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 09:52:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 09:52:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 09:52:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 09:52:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 09:52:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 09:52:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 09:52:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:52:42,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:52:42,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466319380] [2024-11-07 09:52:42,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466319380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:52:42,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:52:42,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 09:52:42,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246292584] [2024-11-07 09:52:42,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:52:42,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 09:52:42,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:52:42,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 09:52:42,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 09:52:42,781 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:52:42,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:52:42,873 INFO L93 Difference]: Finished difference Result 145 states and 208 transitions. [2024-11-07 09:52:42,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 09:52:42,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-11-07 09:52:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:52:42,876 INFO L225 Difference]: With dead ends: 145 [2024-11-07 09:52:42,876 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 09:52:42,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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 09:52:42,877 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 66 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:52:42,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 197 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:52:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 09:52:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 79. [2024-11-07 09:52:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 09:52:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 112 transitions. [2024-11-07 09:52:42,896 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 112 transitions. Word has length 92 [2024-11-07 09:52:42,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:52:42,897 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 112 transitions. [2024-11-07 09:52:42,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:52:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 112 transitions. [2024-11-07 09:52:42,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 09:52:42,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:52:42,899 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:52:42,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:52:42,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:52:42,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:52:42,900 INFO L85 PathProgramCache]: Analyzing trace with hash -892667216, now seen corresponding path program 1 times [2024-11-07 09:52:42,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:52:42,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494563796] [2024-11-07 09:52:42,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:52:42,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:52:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:52:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 09:52:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 09:52:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 09:52:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:52:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 09:52:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 09:52:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 09:52:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 09:52:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 09:52:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 09:52:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 09:52:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 09:52:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:52:43,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:52:43,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494563796] [2024-11-07 09:52:43,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494563796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:52:43,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:52:43,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 09:52:43,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98658923] [2024-11-07 09:52:43,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:52:43,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 09:52:43,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:52:43,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 09:52:43,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 09:52:43,231 INFO L87 Difference]: Start difference. First operand 79 states and 112 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:52:43,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:52:43,431 INFO L93 Difference]: Finished difference Result 207 states and 290 transitions. [2024-11-07 09:52:43,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 09:52:43,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-11-07 09:52:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:52:43,435 INFO L225 Difference]: With dead ends: 207 [2024-11-07 09:52:43,435 INFO L226 Difference]: Without dead ends: 160 [2024-11-07 09:52:43,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:52:43,436 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 81 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:52:43,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 205 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:52:43,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-07 09:52:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2024-11-07 09:52:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 103 states have (on average 1.2233009708737863) internal successors, (126), 104 states have internal predecessors, (126), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 09:52:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 218 transitions. [2024-11-07 09:52:43,465 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 218 transitions. Word has length 93 [2024-11-07 09:52:43,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:52:43,466 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 218 transitions. [2024-11-07 09:52:43,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:52:43,466 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 218 transitions. [2024-11-07 09:52:43,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 09:52:43,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:52:43,467 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:52:43,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 09:52:43,467 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:52:43,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:52:43,467 INFO L85 PathProgramCache]: Analyzing trace with hash -83320590, now seen corresponding path program 1 times [2024-11-07 09:52:43,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:52:43,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254255180] [2024-11-07 09:52:43,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:52:43,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:52:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:52:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 09:52:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 09:52:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 09:52:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:52:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 09:52:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 09:52:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 09:52:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 09:52:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 09:52:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 09:52:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 09:52:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 09:52:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,705 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-07 09:52:43,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:52:43,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254255180] [2024-11-07 09:52:43,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254255180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 09:52:43,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477846802] [2024-11-07 09:52:43,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:52:43,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:52:43,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:52:43,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 09:52:43,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 09:52:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:52:43,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 09:52:43,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:52:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-07 09:52:43,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:52:43,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477846802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:52:43,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 09:52:43,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2024-11-07 09:52:43,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349643683] [2024-11-07 09:52:43,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:52:43,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 09:52:43,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:52:43,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 09:52:43,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:52:43,904 INFO L87 Difference]: Start difference. First operand 155 states and 218 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 09:52:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:52:44,190 INFO L93 Difference]: Finished difference Result 433 states and 590 transitions. [2024-11-07 09:52:44,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 09:52:44,190 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 93 [2024-11-07 09:52:44,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:52:44,193 INFO L225 Difference]: With dead ends: 433 [2024-11-07 09:52:44,193 INFO L226 Difference]: Without dead ends: 314 [2024-11-07 09:52:44,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2024-11-07 09:52:44,195 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 159 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:52:44,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 250 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 09:52:44,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-07 09:52:44,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2024-11-07 09:52:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 214 states have (on average 1.2009345794392523) internal successors, (257), 216 states have internal predecessors, (257), 79 states have call successors, (79), 18 states have call predecessors, (79), 18 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-07 09:52:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 415 transitions. [2024-11-07 09:52:44,242 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 415 transitions. Word has length 93 [2024-11-07 09:52:44,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:52:44,242 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 415 transitions. [2024-11-07 09:52:44,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 09:52:44,243 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 415 transitions. [2024-11-07 09:52:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 09:52:44,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:52:44,244 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:52:44,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 09:52:44,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:52:44,448 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:52:44,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:52:44,449 INFO L85 PathProgramCache]: Analyzing trace with hash -670126604, now seen corresponding path program 1 times [2024-11-07 09:52:44,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:52:44,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191503377] [2024-11-07 09:52:44,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:52:44,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:52:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 09:52:44,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1578931894] [2024-11-07 09:52:44,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:52:44,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:52:44,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:52:44,486 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 09:52:44,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 09:52:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:52:44,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 09:52:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:52:44,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 09:52:44,644 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 09:52:44,645 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:52:44,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 09:52:44,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:52:44,853 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 09:52:44,912 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:52:44,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:52:44 BoogieIcfgContainer [2024-11-07 09:52:44,915 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:52:44,915 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:52:44,915 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:52:44,915 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:52:44,916 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:52:42" (3/4) ... [2024-11-07 09:52:44,917 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 09:52:44,918 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:52:44,918 INFO L158 Benchmark]: Toolchain (without parser) took 3492.97ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 49.7MB in the end (delta: 66.8MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2024-11-07 09:52:44,918 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:52:44,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.26ms. Allocated memory is still 142.6MB. Free memory was 116.4MB in the beginning and 103.2MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 09:52:44,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.79ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 101.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:52:44,919 INFO L158 Benchmark]: Boogie Preprocessor took 38.83ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 99.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:52:44,919 INFO L158 Benchmark]: RCFGBuilder took 323.46ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 83.9MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 09:52:44,919 INFO L158 Benchmark]: TraceAbstraction took 2886.89ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 49.8MB in the end (delta: 33.4MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2024-11-07 09:52:44,920 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 142.6MB. Free memory was 49.8MB in the beginning and 49.7MB in the end (delta: 52.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:52:44,920 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.15ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.26ms. Allocated memory is still 142.6MB. Free memory was 116.4MB in the beginning and 103.2MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.79ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 101.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.83ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 99.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 323.46ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 83.9MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2886.89ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 49.8MB in the end (delta: 33.4MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 142.6MB. Free memory was 49.8MB in the beginning and 49.7MB in the end (delta: 52.0kB). 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 117, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryArithmeticFLOAToperation at line 68. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 100.25; [L23] double var_1_5 = 1.9; [L24] double var_1_6 = 7.5; [L25] double var_1_7 = 64.25; [L26] signed long int var_1_8 = 2; [L27] signed long int var_1_9 = 1000000000; [L28] signed long int var_1_10 = 1000000000; [L29] signed long int var_1_11 = 1957998270; [L30] float var_1_12 = 50.25; [L31] float var_1_13 = 9.8; [L32] float var_1_14 = 25.5; [L33] float var_1_15 = 3.5; [L34] signed long int var_1_16 = -500; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 1; [L37] unsigned char var_1_19 = 0; [L38] double last_1_var_1_1 = 100.25; [L39] signed long int last_1_var_1_8 = 2; [L40] float last_1_var_1_12 = 50.25; [L41] signed long int last_1_var_1_16 = -500; [L42] unsigned char last_1_var_1_17 = 1; [L43] unsigned char last_1_var_1_19 = 0; VAL [isInitial=0, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L109] last_1_var_1_1 = var_1_1 [L110] last_1_var_1_8 = var_1_8 [L111] last_1_var_1_12 = var_1_12 [L112] last_1_var_1_16 = var_1_16 [L113] last_1_var_1_17 = var_1_17 [L114] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L124] RET updateLastVariables() [L125] CALL updateVariables() [L85] var_1_5 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L86] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L87] var_1_6 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L88] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L89] var_1_7 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=1000000000] [L90] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=1000000000] [L91] var_1_9 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_9 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L92] RET assume_abort_if_not(var_1_9 >= 536870911) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L93] CALL assume_abort_if_not(var_1_9 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L93] RET assume_abort_if_not(var_1_9 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L94] var_1_10 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_10 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L95] RET assume_abort_if_not(var_1_10 >= 536870911) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L96] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L96] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L97] var_1_11 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L98] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L99] CALL assume_abort_if_not(var_1_11 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L99] RET assume_abort_if_not(var_1_11 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L100] var_1_14 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L101] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L102] var_1_15 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L103] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L104] var_1_18 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L105] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L106] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L106] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L125] RET updateVariables() [L126] CALL step() [L47] COND TRUE \read(last_1_var_1_17) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L48] COND FALSE !(var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (last_1_var_1_1 * 63.375))) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L54] COND FALSE !((((((- var_1_15)) > ((last_1_var_1_12 * var_1_6))) ? ((- var_1_15)) : ((last_1_var_1_12 * var_1_6)))) < var_1_5) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L61] signed long int stepLocal_1 = (((var_1_16) < (var_1_9)) ? (var_1_16) : (var_1_9)); VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_1=-500, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L62] COND TRUE stepLocal_1 >= (var_1_16 - var_1_11) [L63] var_1_12 = var_1_7 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=2, var_1_9=536870911] [L65] var_1_8 = (((var_1_9 + var_1_10) - last_1_var_1_16) - (var_1_11 - ((((last_1_var_1_16) < 0 ) ? -(last_1_var_1_16) : (last_1_var_1_16))))) [L66] signed long int stepLocal_2 = var_1_16; VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_2=-500, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L67] COND TRUE stepLocal_2 < var_1_11 [L68] var_1_13 = ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L72] signed long int stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_0=999, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L73] COND FALSE !(\read(var_1_19)) [L80] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_0=999, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L82] var_1_17 = (((var_1_16 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_0=999, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L126] RET step() [L127] CALL, EXPR property() [L117-L118] return ((((((var_1_19 ? ((var_1_8 >= var_1_8) ? (var_1_1 == ((double) (var_1_5 + var_1_6))) : (var_1_1 == ((double) (4.125 - var_1_7)))) : (var_1_1 == ((double) var_1_5))) && (var_1_8 == ((signed long int) (((var_1_9 + var_1_10) - last_1_var_1_16) - (var_1_11 - ((((last_1_var_1_16) < 0 ) ? -(last_1_var_1_16) : (last_1_var_1_16)))))))) && ((((((var_1_16) < (var_1_9)) ? (var_1_16) : (var_1_9))) >= (var_1_16 - var_1_11)) ? (var_1_12 == ((float) var_1_7)) : 1)) && ((var_1_16 < var_1_11) ? (var_1_13 == ((float) ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f))) : (var_1_13 == ((float) (var_1_15 + ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))))))) && (((((((- var_1_15)) > ((last_1_var_1_12 * var_1_6))) ? ((- var_1_15)) : ((last_1_var_1_12 * var_1_6)))) < var_1_5) ? ((var_1_11 != ((((last_1_var_1_8) < (var_1_10)) ? (last_1_var_1_8) : (var_1_10)))) ? (last_1_var_1_19 ? (var_1_16 == ((signed long int) last_1_var_1_8)) : 1) : 1) : 1)) && (var_1_17 == ((unsigned char) (((var_1_16 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18)))) && (last_1_var_1_17 ? ((var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (last_1_var_1_1 * 63.375))) ? (var_1_19 == ((unsigned char) var_1_18)) : 1) : (var_1_19 == ((unsigned char) var_1_18))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 5, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 318 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 306 mSDsluCounter, 723 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 437 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 322 IncrementalHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 286 mSDtfsCounter, 322 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=312occurred in iteration=4, InterpolantAutomatonStates: 31, 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, 4 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 649 NumberOfCodeBlocks, 649 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 458 ConstructedInterpolants, 0 QuantifiedInterpolants, 898 SizeOfPredicates, 1 NumberOfNonLiveVariables, 248 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 1557/1560 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 09:52:44,940 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_operatoramount_amount50_file-6.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 4702cea995123cc0372f2a641d4c48ccedf5de741e36ed596af4925d0c7d899c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:52:46,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:52:46,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 09:52:46,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:52:46,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:52:46,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:52:46,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:52:46,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:52:46,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:52:46,723 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:52:46,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:52:46,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:52:46,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:52:46,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:52:46,725 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:52:46,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:52:46,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:52:46,725 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:52:46,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:52:46,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:52:46,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:52:46,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:52:46,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:52:46,726 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 09:52:46,726 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 09:52:46,726 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:52:46,726 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 09:52:46,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:52:46,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:52:46,726 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:52:46,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:52:46,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:52:46,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:52:46,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:52:46,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:52:46,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:52:46,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:52:46,727 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:52:46,727 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 09:52:46,728 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 09:52:46,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:52:46,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:52:46,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:52:46,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:52:46,728 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 -> 4702cea995123cc0372f2a641d4c48ccedf5de741e36ed596af4925d0c7d899c [2024-11-07 09:52:46,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:52:46,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:52:46,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:52:46,969 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:52:46,970 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:52:46,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-6.i [2024-11-07 09:52:48,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:52:48,318 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:52:48,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-6.i [2024-11-07 09:52:48,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21324a7e4/a2ca6bb5a8b04f518f5506cac5c8a4be/FLAG20385b4f3 [2024-11-07 09:52:48,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21324a7e4/a2ca6bb5a8b04f518f5506cac5c8a4be [2024-11-07 09:52:48,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:52:48,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:52:48,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:52:48,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:52:48,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:52:48,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:52:48" (1/1) ... [2024-11-07 09:52:48,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71faf132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:48, skipping insertion in model container [2024-11-07 09:52:48,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:52:48" (1/1) ... [2024-11-07 09:52:48,701 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:52:48,792 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_operatoramount_amount50_file-6.i[914,927] [2024-11-07 09:52:48,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:52:48,837 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:52:48,844 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_operatoramount_amount50_file-6.i[914,927] [2024-11-07 09:52:48,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:52:48,870 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:52:48,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:48 WrapperNode [2024-11-07 09:52:48,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:52:48,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:52:48,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:52:48,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:52:48,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:48" (1/1) ... [2024-11-07 09:52:48,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:48" (1/1) ... [2024-11-07 09:52:48,911 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-11-07 09:52:48,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:52:48,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:52:48,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:52:48,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:52:48,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:48" (1/1) ... [2024-11-07 09:52:48,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:48" (1/1) ... [2024-11-07 09:52:48,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:48" (1/1) ... [2024-11-07 09:52:48,938 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 09:52:48,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:48" (1/1) ... [2024-11-07 09:52:48,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:48" (1/1) ... [2024-11-07 09:52:48,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:48" (1/1) ... [2024-11-07 09:52:48,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:48" (1/1) ... [2024-11-07 09:52:48,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:48" (1/1) ... [2024-11-07 09:52:48,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:48" (1/1) ... [2024-11-07 09:52:48,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:52:48,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:52:48,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:52:48,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:52:48,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:48" (1/1) ... [2024-11-07 09:52:48,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:52:48,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:52:49,000 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 09:52:49,002 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 09:52:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:52:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 09:52:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:52:49,020 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:52:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:52:49,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:52:49,088 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:52:49,089 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:53:11,794 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 09:53:11,795 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:53:11,805 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:53:11,805 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:53:11,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:53:11 BoogieIcfgContainer [2024-11-07 09:53:11,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:53:11,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:53:11,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:53:11,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:53:11,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:52:48" (1/3) ... [2024-11-07 09:53:11,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f936e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:53:11, skipping insertion in model container [2024-11-07 09:53:11,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:52:48" (2/3) ... [2024-11-07 09:53:11,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f936e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:53:11, skipping insertion in model container [2024-11-07 09:53:11,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:53:11" (3/3) ... [2024-11-07 09:53:11,814 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-6.i [2024-11-07 09:53:11,824 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:53:11,824 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:53:11,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:53:11,879 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;@134fd023, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:53:11,879 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:53:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 09:53:11,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 09:53:11,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:53:11,890 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:53:11,891 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:53:11,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:53:11,893 INFO L85 PathProgramCache]: Analyzing trace with hash -575662562, now seen corresponding path program 1 times [2024-11-07 09:53:11,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:53:11,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994364062] [2024-11-07 09:53:11,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:53:11,903 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 09:53:11,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:53:11,906 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 09:53:11,908 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 09:53:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:53:12,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 09:53:12,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:53:12,588 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 09:53:12,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:53:12,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:53:12,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994364062] [2024-11-07 09:53:12,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994364062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:53:12,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:53:12,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:53:12,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295670228] [2024-11-07 09:53:12,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:53:12,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:53:12,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:53:12,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:53:12,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:53:12,612 INFO L87 Difference]: Start difference. First operand has 54 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 09:53:12,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:53:12,630 INFO L93 Difference]: Finished difference Result 101 states and 163 transitions. [2024-11-07 09:53:12,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:53:12,632 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 92 [2024-11-07 09:53:12,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:53:12,636 INFO L225 Difference]: With dead ends: 101 [2024-11-07 09:53:12,637 INFO L226 Difference]: Without dead ends: 50 [2024-11-07 09:53:12,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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 09:53:12,641 INFO L432 NwaCegarLoop]: 71 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, 71 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 09:53:12,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:53:12,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-07 09:53:12,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-07 09:53:12,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 09:53:12,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2024-11-07 09:53:12,673 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 92 [2024-11-07 09:53:12,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:53:12,673 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2024-11-07 09:53:12,674 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 09:53:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2024-11-07 09:53:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 09:53:12,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:53:12,677 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:53:12,701 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 09:53:12,878 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 09:53:12,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:53:12,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:53:12,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1093888672, now seen corresponding path program 1 times [2024-11-07 09:53:12,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:53:12,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830066879] [2024-11-07 09:53:12,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:53:12,880 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 09:53:12,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:53:12,882 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 09:53:12,883 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 09:53:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:53:13,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 09:53:13,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:53:15,750 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:53:15,750 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:53:15,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:53:15,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830066879] [2024-11-07 09:53:15,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830066879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:53:15,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:53:15,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 09:53:15,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186898536] [2024-11-07 09:53:15,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:53:15,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 09:53:15,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:53:15,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 09:53:15,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 09:53:15,758 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:53:20,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:53:24,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:53:28,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:53:32,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:53:32,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:53:32,757 INFO L93 Difference]: Finished difference Result 145 states and 208 transitions. [2024-11-07 09:53:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 09:53:32,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-11-07 09:53:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:53:32,858 INFO L225 Difference]: With dead ends: 145 [2024-11-07 09:53:32,858 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 09:53:32,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:53:32,859 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 63 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 27 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2024-11-07 09:53:32,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 198 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 7 Invalid, 4 Unknown, 0 Unchecked, 16.9s Time] [2024-11-07 09:53:32,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 09:53:32,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 79. [2024-11-07 09:53:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 09:53:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 112 transitions. [2024-11-07 09:53:32,871 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 112 transitions. Word has length 92 [2024-11-07 09:53:32,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:53:32,872 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 112 transitions. [2024-11-07 09:53:32,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:53:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 112 transitions. [2024-11-07 09:53:32,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 09:53:32,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:53:32,874 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:53:32,898 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 09:53:33,074 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 09:53:33,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:53:33,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:53:33,075 INFO L85 PathProgramCache]: Analyzing trace with hash -892667216, now seen corresponding path program 1 times [2024-11-07 09:53:33,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:53:33,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630223675] [2024-11-07 09:53:33,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:53:33,075 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 09:53:33,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:53:33,077 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 09:53:33,078 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 09:53:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:53:33,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 09:53:33,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:53:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 166 proven. 15 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-07 09:53:37,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 09:53:40,887 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-07 09:53:40,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:53:40,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630223675] [2024-11-07 09:53:40,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630223675] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 09:53:40,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 09:53:40,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-11-07 09:53:40,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351147272] [2024-11-07 09:53:40,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 09:53:40,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 09:53:40,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:53:40,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 09:53:40,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-07 09:53:40,889 INFO L87 Difference]: Start difference. First operand 79 states and 112 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-07 09:53:46,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:53:51,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:53:55,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:53:59,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:54:03,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:54:07,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:54:12,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:54:16,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:54:20,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:54:24,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []