./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.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_amount10_file-80.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', '85b1d2ec59250ca50e4af3cfea516d1a969ce9b16ea60a43749666e7f67d56c7'] 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_amount10_file-80.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 85b1d2ec59250ca50e4af3cfea516d1a969ce9b16ea60a43749666e7f67d56c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:15:47,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:15:47,591 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:15:47,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:15:47,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:15:47,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:15:47,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:15:47,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:15:47,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:15:47,629 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:15:47,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:15:47,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:15:47,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:15:47,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:15:47,630 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:15:47,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:15:47,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:15:47,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:15:47,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:15:47,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:15:47,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:15:47,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:15:47,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:15:47,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:15:47,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:15:47,630 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:15:47,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:15:47,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:15:47,631 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:15:47,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:15:47,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:15:47,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:15:47,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:15:47,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:15:47,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:15:47,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:15:47,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:15:47,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:15:47,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:15:47,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:15:47,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:15:47,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:15:47,635 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 -> 85b1d2ec59250ca50e4af3cfea516d1a969ce9b16ea60a43749666e7f67d56c7 [2024-11-07 09:15:47,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:15:47,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:15:47,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:15:47,934 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:15:47,935 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:15:47,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i [2024-11-07 09:15:49,306 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:15:49,576 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:15:49,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i [2024-11-07 09:15:49,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f14296b1/01ae0d768c3043eaa98709883b5a3206/FLAGabd1924ff [2024-11-07 09:15:49,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f14296b1/01ae0d768c3043eaa98709883b5a3206 [2024-11-07 09:15:49,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:15:49,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:15:49,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:15:49,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:15:49,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:15:49,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:15:49" (1/1) ... [2024-11-07 09:15:49,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b3548e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:49, skipping insertion in model container [2024-11-07 09:15:49,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:15:49" (1/1) ... [2024-11-07 09:15:49,637 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:15:49,763 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_amount10_file-80.i[915,928] [2024-11-07 09:15:49,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:15:49,814 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:15:49,824 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_amount10_file-80.i[915,928] [2024-11-07 09:15:49,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:15:49,854 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:15:49,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:49 WrapperNode [2024-11-07 09:15:49,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:15:49,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:15:49,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:15:49,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:15:49,862 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:15:49" (1/1) ... [2024-11-07 09:15:49,867 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:15:49" (1/1) ... [2024-11-07 09:15:49,889 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2024-11-07 09:15:49,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:15:49,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:15:49,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:15:49,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:15:49,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:49" (1/1) ... [2024-11-07 09:15:49,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:49" (1/1) ... [2024-11-07 09:15:49,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:49" (1/1) ... [2024-11-07 09:15:49,919 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:15:49,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:49" (1/1) ... [2024-11-07 09:15:49,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:49" (1/1) ... [2024-11-07 09:15:49,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:49" (1/1) ... [2024-11-07 09:15:49,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:49" (1/1) ... [2024-11-07 09:15:49,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:49" (1/1) ... [2024-11-07 09:15:49,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:49" (1/1) ... [2024-11-07 09:15:49,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:15:49,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:15:49,934 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:15:49,934 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:15:49,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:49" (1/1) ... [2024-11-07 09:15:49,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:15:49,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:15:49,977 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:15:49,981 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:15:50,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:15:50,002 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:15:50,002 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:15:50,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:15:50,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:15:50,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:15:50,058 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:15:50,060 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:15:50,197 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 09:15:50,198 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:15:50,206 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:15:50,206 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:15:50,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:15:50 BoogieIcfgContainer [2024-11-07 09:15:50,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:15:50,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:15:50,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:15:50,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:15:50,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:15:49" (1/3) ... [2024-11-07 09:15:50,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fe4e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:15:50, skipping insertion in model container [2024-11-07 09:15:50,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:49" (2/3) ... [2024-11-07 09:15:50,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fe4e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:15:50, skipping insertion in model container [2024-11-07 09:15:50,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:15:50" (3/3) ... [2024-11-07 09:15:50,216 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-80.i [2024-11-07 09:15:50,229 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:15:50,230 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:15:50,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:15:50,301 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;@2e5fe619, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:15:50,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:15:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 09:15:50,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 09:15:50,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:15:50,315 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:50,316 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:15:50,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:15:50,324 INFO L85 PathProgramCache]: Analyzing trace with hash 211231747, now seen corresponding path program 1 times [2024-11-07 09:15:50,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:15:50,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265515118] [2024-11-07 09:15:50,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:15:50,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:15:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:50,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:15:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:50,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 09:15:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:50,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 09:15:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:50,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 09:15:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:50,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:15:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:50,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 09:15:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:50,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 09:15:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:50,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 09:15:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:50,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 09:15:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:50,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 09:15:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 09:15:50,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:15:50,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265515118] [2024-11-07 09:15:50,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265515118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:15:50,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:15:50,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:15:50,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278983352] [2024-11-07 09:15:50,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:15:50,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:15:50,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:15:50,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:15:50,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:15:50,640 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 09:15:50,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:15:50,654 INFO L93 Difference]: Finished difference Result 67 states and 106 transitions. [2024-11-07 09:15:50,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:15:50,656 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 66 [2024-11-07 09:15:50,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:15:50,662 INFO L225 Difference]: With dead ends: 67 [2024-11-07 09:15:50,663 INFO L226 Difference]: Without dead ends: 33 [2024-11-07 09:15:50,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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:15:50,670 INFO L432 NwaCegarLoop]: 44 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, 44 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:15:50,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:15:50,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-07 09:15:50,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-07 09:15:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 09:15:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-11-07 09:15:50,713 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 66 [2024-11-07 09:15:50,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:15:50,713 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-11-07 09:15:50,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 09:15:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-11-07 09:15:50,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 09:15:50,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:15:50,717 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:50,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:15:50,717 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:15:50,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:15:50,718 INFO L85 PathProgramCache]: Analyzing trace with hash 409964679, now seen corresponding path program 1 times [2024-11-07 09:15:50,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:15:50,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030933681] [2024-11-07 09:15:50,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:15:50,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:15:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:51,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:15:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:51,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 09:15:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:51,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 09:15:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:51,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 09:15:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:51,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:15:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:51,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 09:15:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:51,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 09:15:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:51,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 09:15:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:51,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 09:15:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:51,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 09:15:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:51,577 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 09:15:51,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:15:51,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030933681] [2024-11-07 09:15:51,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030933681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:15:51,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:15:51,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 09:15:51,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587633108] [2024-11-07 09:15:51,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:15:51,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 09:15:51,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:15:51,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 09:15:51,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 09:15:51,582 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:15:51,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:15:51,809 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2024-11-07 09:15:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 09:15:51,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2024-11-07 09:15:51,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:15:51,812 INFO L225 Difference]: With dead ends: 77 [2024-11-07 09:15:51,812 INFO L226 Difference]: Without dead ends: 75 [2024-11-07 09:15:51,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 09:15:51,815 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 76 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:15:51,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 239 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:15:51,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-07 09:15:51,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 54. [2024-11-07 09:15:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 09:15:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2024-11-07 09:15:51,853 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 66 [2024-11-07 09:15:51,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:15:51,853 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2024-11-07 09:15:51,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:15:51,853 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2024-11-07 09:15:51,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 09:15:51,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:15:51,857 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:51,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:15:51,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:15:51,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:15:51,858 INFO L85 PathProgramCache]: Analyzing trace with hash -411557169, now seen corresponding path program 1 times [2024-11-07 09:15:51,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:15:51,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932030213] [2024-11-07 09:15:51,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:15:51,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:15:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:52,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:15:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:52,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 09:15:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:52,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 09:15:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:52,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 09:15:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:52,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:15:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:52,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 09:15:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:52,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 09:15:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:52,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 09:15:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:52,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 09:15:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:52,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 09:15:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:52,691 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 09:15:52,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:15:52,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932030213] [2024-11-07 09:15:52,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932030213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:15:52,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:15:52,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 09:15:52,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992421609] [2024-11-07 09:15:52,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:15:52,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 09:15:52,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:15:52,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 09:15:52,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:15:52,693 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:15:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:15:53,092 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2024-11-07 09:15:53,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 09:15:53,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-07 09:15:53,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:15:53,098 INFO L225 Difference]: With dead ends: 94 [2024-11-07 09:15:53,098 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 09:15:53,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:15:53,100 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 89 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:15:53,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 233 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 09:15:53,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 09:15:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2024-11-07 09:15:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 38 states have internal predecessors, (40), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 09:15:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2024-11-07 09:15:53,120 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 67 [2024-11-07 09:15:53,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:15:53,120 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2024-11-07 09:15:53,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:15:53,121 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2024-11-07 09:15:53,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 09:15:53,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:15:53,122 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:53,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 09:15:53,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:15:53,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:15:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash -409710127, now seen corresponding path program 1 times [2024-11-07 09:15:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:15:53,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902281863] [2024-11-07 09:15:53,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:15:53,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:15:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:15:53,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 09:15:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:15:53,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 09:15:53,233 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 09:15:53,234 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:15:53,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 09:15:53,239 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 09:15:53,280 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:15:53,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:15:53 BoogieIcfgContainer [2024-11-07 09:15:53,284 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:15:53,284 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:15:53,284 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:15:53,285 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:15:53,285 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:15:50" (3/4) ... [2024-11-07 09:15:53,287 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 09:15:53,289 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:15:53,290 INFO L158 Benchmark]: Toolchain (without parser) took 3680.43ms. Allocated memory is still 100.7MB. Free memory was 77.2MB in the beginning and 42.1MB in the end (delta: 35.1MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2024-11-07 09:15:53,290 INFO L158 Benchmark]: CDTParser took 0.86ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:15:53,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.69ms. Allocated memory is still 100.7MB. Free memory was 77.1MB in the beginning and 65.6MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:15:53,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.81ms. Allocated memory is still 100.7MB. Free memory was 65.6MB in the beginning and 64.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:15:53,291 INFO L158 Benchmark]: Boogie Preprocessor took 39.53ms. Allocated memory is still 100.7MB. Free memory was 64.1MB in the beginning and 62.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:15:53,291 INFO L158 Benchmark]: RCFGBuilder took 273.15ms. Allocated memory is still 100.7MB. Free memory was 62.6MB in the beginning and 51.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:15:53,291 INFO L158 Benchmark]: TraceAbstraction took 3074.68ms. Allocated memory is still 100.7MB. Free memory was 50.7MB in the beginning and 42.2MB in the end (delta: 8.6MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-11-07 09:15:53,291 INFO L158 Benchmark]: Witness Printer took 4.60ms. Allocated memory is still 100.7MB. Free memory was 42.2MB in the beginning and 42.1MB in the end (delta: 34.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:15:53,295 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.86ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.69ms. Allocated memory is still 100.7MB. Free memory was 77.1MB in the beginning and 65.6MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.81ms. Allocated memory is still 100.7MB. Free memory was 65.6MB in the beginning and 64.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.53ms. Allocated memory is still 100.7MB. Free memory was 64.1MB in the beginning and 62.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 273.15ms. Allocated memory is still 100.7MB. Free memory was 62.6MB in the beginning and 51.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3074.68ms. Allocated memory is still 100.7MB. Free memory was 50.7MB in the beginning and 42.2MB in the end (delta: 8.6MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Witness Printer took 4.60ms. Allocated memory is still 100.7MB. Free memory was 42.2MB in the beginning and 42.1MB in the end (delta: 34.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] float var_1_4 = 200.75; [L24] float var_1_5 = 5.7; [L25] signed short int var_1_6 = 200; [L26] signed short int var_1_7 = 256; [L27] signed short int var_1_8 = -16; [L28] unsigned char var_1_9 = 1; [L29] unsigned char var_1_10 = 0; VAL [isInitial=0, var_1_10=0, var_1_1=4, var_1_4=803/4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L65] isInitial = 1 [L66] FCALL initially() [L67] COND TRUE 1 [L68] FCALL updateLastVariables() [L69] CALL updateVariables() [L41] var_1_4 = __VERIFIER_nondet_float() [L42] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L42] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L43] var_1_5 = __VERIFIER_nondet_float() [L44] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L44] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L45] var_1_6 = __VERIFIER_nondet_short() [L46] CALL assume_abort_if_not(var_1_6 >= -8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L46] RET assume_abort_if_not(var_1_6 >= -8192) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L47] CALL assume_abort_if_not(var_1_6 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L47] RET assume_abort_if_not(var_1_6 <= 8192) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L48] var_1_7 = __VERIFIER_nondet_short() [L49] CALL assume_abort_if_not(var_1_7 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L49] RET assume_abort_if_not(var_1_7 >= -8191) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L50] CALL assume_abort_if_not(var_1_7 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L50] RET assume_abort_if_not(var_1_7 <= 8191) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L51] var_1_8 = __VERIFIER_nondet_short() [L52] CALL assume_abort_if_not(var_1_8 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L52] RET assume_abort_if_not(var_1_8 >= -16383) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L53] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L53] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L54] var_1_10 = __VERIFIER_nondet_uchar() [L55] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L55] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L56] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L56] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L69] RET updateVariables() [L70] CALL step() [L33] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L34] COND TRUE ! (var_1_9 && var_1_9) VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L35] COND FALSE !(var_1_4 <= var_1_5) VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L70] RET step() [L71] CALL, EXPR property() [L61-L62] return ((! (var_1_9 && var_1_9)) ? ((var_1_4 <= var_1_5) ? (var_1_1 == ((signed short int) ((((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) + var_1_7) + var_1_8))) : 1) : 1) && (var_1_9 == ((unsigned char) var_1_10)) ; VAL [\result=0, isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L71] RET, EXPR property() [L71] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L19] reach_error() VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 516 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 339 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 177 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=2, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 60 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 461 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 540/540 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:15:53,318 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_amount10_file-80.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 85b1d2ec59250ca50e4af3cfea516d1a969ce9b16ea60a43749666e7f67d56c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:15:55,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:15:55,727 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:15:55,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:15:55,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:15:55,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:15:55,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:15:55,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:15:55,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:15:55,759 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:15:55,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:15:55,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:15:55,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:15:55,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:15:55,761 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:15:55,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:15:55,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:15:55,761 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:15:55,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:15:55,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:15:55,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:15:55,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:15:55,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:15:55,761 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 09:15:55,761 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 09:15:55,761 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:15:55,762 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 09:15:55,762 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:15:55,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:15:55,762 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:15:55,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:15:55,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:15:55,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:15:55,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:15:55,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:15:55,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:15:55,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:15:55,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:15:55,765 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 09:15:55,765 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 09:15:55,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:15:55,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:15:55,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:15:55,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:15:55,766 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 -> 85b1d2ec59250ca50e4af3cfea516d1a969ce9b16ea60a43749666e7f67d56c7 [2024-11-07 09:15:56,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:15:56,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:15:56,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:15:56,068 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:15:56,068 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:15:56,069 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i [2024-11-07 09:15:57,374 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:15:57,613 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:15:57,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i [2024-11-07 09:15:57,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67dcf59f3/fa69565ea1f949e0bb733f87b0b3f26b/FLAG3515eb7d7 [2024-11-07 09:15:57,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67dcf59f3/fa69565ea1f949e0bb733f87b0b3f26b [2024-11-07 09:15:57,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:15:57,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:15:57,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:15:57,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:15:57,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:15:57,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:15:57" (1/1) ... [2024-11-07 09:15:57,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@356323f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:57, skipping insertion in model container [2024-11-07 09:15:57,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:15:57" (1/1) ... [2024-11-07 09:15:57,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:15:57,814 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_amount10_file-80.i[915,928] [2024-11-07 09:15:57,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:15:57,870 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:15:57,882 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_amount10_file-80.i[915,928] [2024-11-07 09:15:57,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:15:57,925 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:15:57,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:57 WrapperNode [2024-11-07 09:15:57,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:15:57,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:15:57,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:15:57,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:15:57,937 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:15:57" (1/1) ... [2024-11-07 09:15:57,947 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:15:57" (1/1) ... [2024-11-07 09:15:57,969 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 74 [2024-11-07 09:15:57,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:15:57,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:15:57,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:15:57,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:15:57,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:57" (1/1) ... [2024-11-07 09:15:57,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:57" (1/1) ... [2024-11-07 09:15:57,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:57" (1/1) ... [2024-11-07 09:15:57,998 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:15:58,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:57" (1/1) ... [2024-11-07 09:15:58,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:57" (1/1) ... [2024-11-07 09:15:58,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:57" (1/1) ... [2024-11-07 09:15:58,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:57" (1/1) ... [2024-11-07 09:15:58,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:57" (1/1) ... [2024-11-07 09:15:58,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:57" (1/1) ... [2024-11-07 09:15:58,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:15:58,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:15:58,026 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:15:58,026 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:15:58,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:57" (1/1) ... [2024-11-07 09:15:58,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:15:58,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:15:58,063 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:15:58,069 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:15:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:15:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 09:15:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:15:58,090 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:15:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:15:58,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:15:58,170 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:15:58,172 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:15:58,347 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 09:15:58,347 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:15:58,360 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:15:58,361 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:15:58,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:15:58 BoogieIcfgContainer [2024-11-07 09:15:58,362 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:15:58,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:15:58,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:15:58,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:15:58,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:15:57" (1/3) ... [2024-11-07 09:15:58,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490b148f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:15:58, skipping insertion in model container [2024-11-07 09:15:58,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:57" (2/3) ... [2024-11-07 09:15:58,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490b148f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:15:58, skipping insertion in model container [2024-11-07 09:15:58,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:15:58" (3/3) ... [2024-11-07 09:15:58,373 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-80.i [2024-11-07 09:15:58,388 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:15:58,388 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:15:58,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:15:58,456 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;@6f1c4e86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:15:58,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:15:58,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 09:15:58,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 09:15:58,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:15:58,469 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:58,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:15:58,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:15:58,473 INFO L85 PathProgramCache]: Analyzing trace with hash 211231747, now seen corresponding path program 1 times [2024-11-07 09:15:58,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:15:58,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168329605] [2024-11-07 09:15:58,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:15:58,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 09:15:58,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:15:58,485 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:15:58,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 09:15:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:58,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 09:15:58,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:15:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-07 09:15:58,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:15:58,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:15:58,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168329605] [2024-11-07 09:15:58,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168329605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:15:58,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:15:58,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:15:58,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126966369] [2024-11-07 09:15:58,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:15:58,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:15:58,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:15:58,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:15:58,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:15:58,704 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:15:58,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:15:58,722 INFO L93 Difference]: Finished difference Result 67 states and 106 transitions. [2024-11-07 09:15:58,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:15:58,725 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2024-11-07 09:15:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:15:58,729 INFO L225 Difference]: With dead ends: 67 [2024-11-07 09:15:58,729 INFO L226 Difference]: Without dead ends: 33 [2024-11-07 09:15:58,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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:15:58,735 INFO L432 NwaCegarLoop]: 44 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, 44 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:15:58,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:15:58,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-07 09:15:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-07 09:15:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 09:15:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-11-07 09:15:58,767 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 66 [2024-11-07 09:15:58,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:15:58,768 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-11-07 09:15:58,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:15:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-11-07 09:15:58,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 09:15:58,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:15:58,772 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:58,779 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:15:58,973 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:15:58,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:15:58,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:15:58,974 INFO L85 PathProgramCache]: Analyzing trace with hash 409964679, now seen corresponding path program 1 times [2024-11-07 09:15:58,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:15:58,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530858287] [2024-11-07 09:15:58,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:15:58,975 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:15:58,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:15:58,979 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:15:58,981 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:15:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:59,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 09:15:59,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:15:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-07 09:15:59,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:15:59,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:15:59,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530858287] [2024-11-07 09:15:59,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530858287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:15:59,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:15:59,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 09:15:59,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924812480] [2024-11-07 09:15:59,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:15:59,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 09:15:59,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:15:59,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 09:15:59,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 09:15:59,227 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:15:59,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:15:59,617 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2024-11-07 09:15:59,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 09:15:59,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2024-11-07 09:15:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:15:59,621 INFO L225 Difference]: With dead ends: 97 [2024-11-07 09:15:59,621 INFO L226 Difference]: Without dead ends: 67 [2024-11-07 09:15:59,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-07 09:15:59,624 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 56 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:15:59,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 121 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 09:15:59,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-07 09:15:59,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2024-11-07 09:15:59,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 09:15:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2024-11-07 09:15:59,641 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 66 [2024-11-07 09:15:59,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:15:59,642 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-11-07 09:15:59,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:15:59,643 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-11-07 09:15:59,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 09:15:59,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:15:59,644 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:59,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 09:15:59,844 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:15:59,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:15:59,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:15:59,846 INFO L85 PathProgramCache]: Analyzing trace with hash -411557169, now seen corresponding path program 1 times [2024-11-07 09:15:59,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:15:59,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135044749] [2024-11-07 09:15:59,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:15:59,846 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:15:59,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:15:59,850 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:15:59,851 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:15:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:59,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 09:15:59,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:16:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 124 proven. 24 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-07 09:16:01,601 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 09:16:02,012 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 09:16:02,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:16:02,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135044749] [2024-11-07 09:16:02,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135044749] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 09:16:02,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 09:16:02,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2024-11-07 09:16:02,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055444078] [2024-11-07 09:16:02,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:16:02,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 09:16:02,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:16:02,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 09:16:02,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2024-11-07 09:16:02,015 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:16:02,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:16:02,294 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2024-11-07 09:16:02,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 09:16:02,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-07 09:16:02,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:16:02,296 INFO L225 Difference]: With dead ends: 72 [2024-11-07 09:16:02,296 INFO L226 Difference]: Without dead ends: 70 [2024-11-07 09:16:02,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2024-11-07 09:16:02,298 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 47 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:16:02,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 254 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 09:16:02,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-07 09:16:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 50. [2024-11-07 09:16:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 09:16:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2024-11-07 09:16:02,315 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 67 [2024-11-07 09:16:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:16:02,316 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2024-11-07 09:16:02,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:16:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2024-11-07 09:16:02,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 09:16:02,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:16:02,317 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:02,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 09:16:02,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 09:16:02,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:16:02,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:16:02,519 INFO L85 PathProgramCache]: Analyzing trace with hash -409710127, now seen corresponding path program 1 times [2024-11-07 09:16:02,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:16:02,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080463348] [2024-11-07 09:16:02,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:16:02,519 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:16:02,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:16:02,523 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 09:16:02,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 09:16:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:02,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 09:16:02,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:16:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 09:16:02,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:16:02,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:16:02,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080463348] [2024-11-07 09:16:02,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080463348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:16:02,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:16:02,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 09:16:02,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937535845] [2024-11-07 09:16:02,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:16:02,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 09:16:02,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:16:02,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 09:16:02,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 09:16:02,857 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:16:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:16:03,033 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2024-11-07 09:16:03,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 09:16:03,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-07 09:16:03,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:16:03,034 INFO L225 Difference]: With dead ends: 69 [2024-11-07 09:16:03,034 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 09:16:03,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 09:16:03,035 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 35 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:16:03,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 238 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:16:03,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 09:16:03,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 09:16:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 09:16:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 09:16:03,039 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2024-11-07 09:16:03,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:16:03,040 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 09:16:03,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:16:03,040 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 09:16:03,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 09:16:03,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:16:03,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 09:16:03,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 09:16:03,248 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 09:16:03,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 09:16:03,391 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:16:03,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:16:03 BoogieIcfgContainer [2024-11-07 09:16:03,408 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:16:03,409 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:16:03,409 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:16:03,409 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:16:03,410 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:15:58" (3/4) ... [2024-11-07 09:16:03,412 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 09:16:03,417 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 09:16:03,421 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-07 09:16:03,421 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-07 09:16:03,422 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 09:16:03,422 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 09:16:03,496 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 09:16:03,497 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 09:16:03,497 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:16:03,498 INFO L158 Benchmark]: Toolchain (without parser) took 5849.49ms. Allocated memory was 83.9MB in the beginning and 167.8MB in the end (delta: 83.9MB). Free memory was 61.4MB in the beginning and 94.9MB in the end (delta: -33.5MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2024-11-07 09:16:03,498 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:16:03,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.53ms. Allocated memory is still 83.9MB. Free memory was 61.4MB in the beginning and 49.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:16:03,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.25ms. Allocated memory is still 83.9MB. Free memory was 49.2MB in the beginning and 47.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:16:03,499 INFO L158 Benchmark]: Boogie Preprocessor took 54.66ms. Allocated memory is still 83.9MB. Free memory was 47.7MB in the beginning and 46.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:16:03,500 INFO L158 Benchmark]: RCFGBuilder took 336.63ms. Allocated memory is still 83.9MB. Free memory was 46.0MB in the beginning and 34.1MB in the end (delta: 11.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:16:03,500 INFO L158 Benchmark]: TraceAbstraction took 5043.78ms. Allocated memory was 83.9MB in the beginning and 167.8MB in the end (delta: 83.9MB). Free memory was 33.8MB in the beginning and 100.4MB in the end (delta: -66.6MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-11-07 09:16:03,501 INFO L158 Benchmark]: Witness Printer took 88.12ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 94.9MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:16:03,503 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.20ms. Allocated memory is still 83.9MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.53ms. Allocated memory is still 83.9MB. Free memory was 61.4MB in the beginning and 49.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.25ms. Allocated memory is still 83.9MB. Free memory was 49.2MB in the beginning and 47.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.66ms. Allocated memory is still 83.9MB. Free memory was 47.7MB in the beginning and 46.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 336.63ms. Allocated memory is still 83.9MB. Free memory was 46.0MB in the beginning and 34.1MB in the end (delta: 11.9MB). There was no memory consumed. Max. memory is 16.1GB. * TraceAbstraction took 5043.78ms. Allocated memory was 83.9MB in the beginning and 167.8MB in the end (delta: 83.9MB). Free memory was 33.8MB in the beginning and 100.4MB in the end (delta: -66.6MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * Witness Printer took 88.12ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 94.9MB in the end (delta: 5.5MB). 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 148 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 657 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 432 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 249 IncrementalHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 225 mSDtfsCounter, 249 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=3, InterpolantAutomatonStates: 29, 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, 50 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 873 SizeOfPredicates, 21 NumberOfNonLiveVariables, 439 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 876/900 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: (var_1_10 <= 0) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && (((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10)))) RESULT: Ultimate proved your program to be correct! [2024-11-07 09:16:03,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE