./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d1df1bd1626d850654993fe892fd690c3c28a022014cb6e98c76da2bd723c8f9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:11:10,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:11:11,103 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:11:11,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:11:11,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:11:11,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:11:11,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:11:11,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:11:11,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:11:11,146 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:11:11,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:11:11,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:11:11,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:11:11,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:11:11,148 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:11:11,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:11:11,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:11:11,149 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:11:11,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:11:11,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:11:11,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:11:11,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:11:11,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:11:11,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:11:11,156 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:11:11,156 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:11:11,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:11:11,156 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:11:11,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:11:11,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:11:11,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:11:11,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:11:11,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:11:11,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:11:11,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:11:11,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:11:11,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:11:11,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:11:11,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:11:11,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:11:11,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:11:11,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:11:11,164 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> d1df1bd1626d850654993fe892fd690c3c28a022014cb6e98c76da2bd723c8f9 [2024-10-12 18:11:11,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:11:11,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:11:11,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:11:11,489 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:11:11,489 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:11:11,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i [2024-10-12 18:11:13,082 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:11:13,402 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:11:13,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i [2024-10-12 18:11:13,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a84d4a280/d4dfba23c6eb4495a94744da409d01e7/FLAG4b4fecbb2 [2024-10-12 18:11:13,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a84d4a280/d4dfba23c6eb4495a94744da409d01e7 [2024-10-12 18:11:13,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:11:13,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:11:13,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:11:13,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:11:13,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:11:13,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:11:13" (1/1) ... [2024-10-12 18:11:13,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@220c87c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:11:13, skipping insertion in model container [2024-10-12 18:11:13,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:11:13" (1/1) ... [2024-10-12 18:11:13,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:11:14,304 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: isnan at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:610) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:2916) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.lambda$132(StandardFunctionHandler.java:605) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:253) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1586) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:271) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2547) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:307) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:788) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:286) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2547) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:307) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2547) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:307) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1736) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:233) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleCompoundStatement(CHandler.java:1150) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1133) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:236) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:387) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1613) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:159) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3465) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2491) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:639) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:135) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:189) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:116) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:145) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-12 18:11:14,317 INFO L158 Benchmark]: Toolchain (without parser) took 863.22ms. Allocated memory is still 155.2MB. Free memory was 93.1MB in the beginning and 120.7MB in the end (delta: -27.7MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-10-12 18:11:14,318 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 96.5MB. Free memory is still 49.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:11:14,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 861.29ms. Allocated memory is still 155.2MB. Free memory was 92.7MB in the beginning and 120.7MB in the end (delta: -28.0MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-10-12 18:11:14,323 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 96.5MB. Free memory is still 49.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 861.29ms. Allocated memory is still 155.2MB. Free memory was 92.7MB in the beginning and 120.7MB in the end (delta: -28.0MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: isnan de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: isnan: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:610) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d1df1bd1626d850654993fe892fd690c3c28a022014cb6e98c76da2bd723c8f9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:11:16,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:11:16,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-12 18:11:16,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:11:16,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:11:16,693 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:11:16,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:11:16,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:11:16,696 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:11:16,697 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:11:16,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:11:16,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:11:16,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:11:16,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:11:16,702 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:11:16,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:11:16,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:11:16,703 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:11:16,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:11:16,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:11:16,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:11:16,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:11:16,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:11:16,704 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 18:11:16,704 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 18:11:16,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:11:16,705 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 18:11:16,705 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:11:16,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:11:16,706 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:11:16,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:11:16,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:11:16,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:11:16,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:11:16,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:11:16,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:11:16,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:11:16,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:11:16,708 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 18:11:16,708 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 18:11:16,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:11:16,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:11:16,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:11:16,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:11:16,710 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 18:11:16,710 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> d1df1bd1626d850654993fe892fd690c3c28a022014cb6e98c76da2bd723c8f9 [2024-10-12 18:11:17,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:11:17,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:11:17,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:11:17,154 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:11:17,155 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:11:17,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i [2024-10-12 18:11:18,888 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:11:19,210 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:11:19,211 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i [2024-10-12 18:11:19,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a898782c/6f59083d6d134b078b9a829e9715fbf9/FLAG6fd0caa69 [2024-10-12 18:11:19,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a898782c/6f59083d6d134b078b9a829e9715fbf9 [2024-10-12 18:11:19,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:11:19,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:11:19,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:11:19,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:11:19,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:11:19,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:11:19" (1/1) ... [2024-10-12 18:11:19,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71de6dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:11:19, skipping insertion in model container [2024-10-12 18:11:19,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:11:19" (1/1) ... [2024-10-12 18:11:19,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:11:20,015 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i[63746,63759] [2024-10-12 18:11:20,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:11:20,041 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:11:20,110 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i[63746,63759] [2024-10-12 18:11:20,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:11:20,286 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:11:20,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:11:20 WrapperNode [2024-10-12 18:11:20,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:11:20,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:11:20,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:11:20,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:11:20,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:11:20" (1/1) ... [2024-10-12 18:11:20,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:11:20" (1/1) ... [2024-10-12 18:11:20,382 INFO L138 Inliner]: procedures = 562, calls = 36, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 131 [2024-10-12 18:11:20,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:11:20,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:11:20,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:11:20,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:11:20,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:11:20" (1/1) ... [2024-10-12 18:11:20,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:11:20" (1/1) ... [2024-10-12 18:11:20,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:11:20" (1/1) ... [2024-10-12 18:11:20,422 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [2, 7, 12, 4]. 48 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 6 writes are split as follows [0, 0, 4, 2]. [2024-10-12 18:11:20,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:11:20" (1/1) ... [2024-10-12 18:11:20,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:11:20" (1/1) ... [2024-10-12 18:11:20,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:11:20" (1/1) ... [2024-10-12 18:11:20,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:11:20" (1/1) ... [2024-10-12 18:11:20,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:11:20" (1/1) ... [2024-10-12 18:11:20,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:11:20" (1/1) ... [2024-10-12 18:11:20,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:11:20,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:11:20,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:11:20,449 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:11:20,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:11:20" (1/1) ... [2024-10-12 18:11:20,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:11:20,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:11:20,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:11:20,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:11:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-12 18:11:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-12 18:11:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-12 18:11:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-12 18:11:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 18:11:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 18:11:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-12 18:11:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-12 18:11:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-12 18:11:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:11:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:11:20,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:11:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-12 18:11:20,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-12 18:11:20,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-12 18:11:20,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-12 18:11:20,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 18:11:20,682 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:11:20,685 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:11:22,003 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-12 18:11:22,003 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:11:22,048 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:11:22,049 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 18:11:22,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:11:22 BoogieIcfgContainer [2024-10-12 18:11:22,049 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:11:22,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:11:22,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:11:22,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:11:22,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:11:19" (1/3) ... [2024-10-12 18:11:22,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218c1a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:11:22, skipping insertion in model container [2024-10-12 18:11:22,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:11:20" (2/3) ... [2024-10-12 18:11:22,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218c1a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:11:22, skipping insertion in model container [2024-10-12 18:11:22,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:11:22" (3/3) ... [2024-10-12 18:11:22,058 INFO L112 eAbstractionObserver]: Analyzing ICFG softmax_8_safe.c-amalgamation.i [2024-10-12 18:11:22,073 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:11:22,074 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:11:22,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:11:22,143 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;@40ed0f86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:11:22,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:11:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 23 states have internal predecessors, (37), 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-10-12 18:11:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 18:11:22,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:11:22,156 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:11:22,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:11:22,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:11:22,161 INFO L85 PathProgramCache]: Analyzing trace with hash -449196193, now seen corresponding path program 1 times [2024-10-12 18:11:22,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:11:22,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564724271] [2024-10-12 18:11:22,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:11:22,173 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-10-12 18:11:22,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:11:22,175 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-10-12 18:11:22,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-12 18:11:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:11:22,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 18:11:22,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:11:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:11:22,361 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:11:22,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:11:22,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564724271] [2024-10-12 18:11:22,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564724271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:11:22,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:11:22,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:11:22,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463669864] [2024-10-12 18:11:22,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:11:22,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 18:11:22,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:11:22,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 18:11:22,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:11:22,399 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 23 states have internal predecessors, (37), 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) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-10-12 18:11:23,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:11:23,265 INFO L93 Difference]: Finished difference Result 46 states and 71 transitions. [2024-10-12 18:11:23,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 18:11:23,269 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), 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) Word has length 19 [2024-10-12 18:11:23,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:11:23,276 INFO L225 Difference]: With dead ends: 46 [2024-10-12 18:11:23,277 INFO L226 Difference]: Without dead ends: 22 [2024-10-12 18:11:23,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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-10-12 18:11:23,286 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 18:11:23,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 18:11:23,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-12 18:11:23,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-12 18:11:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-10-12 18:11:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-12 18:11:23,349 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 19 [2024-10-12 18:11:23,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:11:23,349 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-12 18:11:23,350 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), 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-10-12 18:11:23,350 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-12 18:11:23,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 18:11:23,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:11:23,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:11:23,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-12 18:11:23,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-10-12 18:11:23,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:11:23,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:11:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash 77606231, now seen corresponding path program 1 times [2024-10-12 18:11:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:11:23,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908463132] [2024-10-12 18:11:23,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:11:23,554 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-10-12 18:11:23,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:11:23,558 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-10-12 18:11:23,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-12 18:11:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:11:23,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 18:11:23,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:11:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:11:23,773 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:11:23,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:11:23,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908463132] [2024-10-12 18:11:23,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908463132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:11:23,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:11:23,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:11:23,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142815511] [2024-10-12 18:11:23,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:11:23,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:11:23,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:11:23,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:11:23,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:11:23,777 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-10-12 18:11:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:11:24,720 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-10-12 18:11:24,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:11:24,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) Word has length 19 [2024-10-12 18:11:24,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:11:24,725 INFO L225 Difference]: With dead ends: 35 [2024-10-12 18:11:24,725 INFO L226 Difference]: Without dead ends: 25 [2024-10-12 18:11:24,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:11:24,727 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 18:11:24,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 31 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 18:11:24,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-12 18:11:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2024-10-12 18:11:24,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-10-12 18:11:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-10-12 18:11:24,737 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2024-10-12 18:11:24,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:11:24,738 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-12 18:11:24,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-10-12 18:11:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-10-12 18:11:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 18:11:24,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:11:24,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:11:24,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-12 18:11:24,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-10-12 18:11:24,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:11:24,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:11:24,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1952854305, now seen corresponding path program 1 times [2024-10-12 18:11:24,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:11:24,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071093824] [2024-10-12 18:11:24,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:11:24,942 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-10-12 18:11:24,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:11:24,946 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-10-12 18:11:24,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-12 18:11:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:11:25,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 18:11:25,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:11:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:11:25,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:11:25,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:11:25,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:11:25,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071093824] [2024-10-12 18:11:25,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071093824] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:11:25,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:11:25,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-12 18:11:25,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439563832] [2024-10-12 18:11:25,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:11:25,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:11:25,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:11:25,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:11:25,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:11:25,413 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-10-12 18:11:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:11:26,433 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-10-12 18:11:26,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:11:26,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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) Word has length 22 [2024-10-12 18:11:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:11:26,438 INFO L225 Difference]: With dead ends: 39 [2024-10-12 18:11:26,438 INFO L226 Difference]: Without dead ends: 29 [2024-10-12 18:11:26,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:11:26,440 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:11:26,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 56 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 18:11:26,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-12 18:11:26,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-12 18:11:26,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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-10-12 18:11:26,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-10-12 18:11:26,446 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2024-10-12 18:11:26,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:11:26,447 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-12 18:11:26,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-10-12 18:11:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-10-12 18:11:26,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 18:11:26,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:11:26,457 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:11:26,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-12 18:11:26,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-10-12 18:11:26,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:11:26,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:11:26,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1295694815, now seen corresponding path program 2 times [2024-10-12 18:11:26,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:11:26,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248089685] [2024-10-12 18:11:26,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:11:26,664 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-10-12 18:11:26,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:11:26,668 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-10-12 18:11:26,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-12 18:11:26,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 18:11:26,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:11:26,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 18:11:26,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:11:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 18:11:26,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:11:26,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:11:26,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248089685] [2024-10-12 18:11:26,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248089685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:11:26,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:11:26,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:11:26,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533529877] [2024-10-12 18:11:26,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:11:26,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:11:26,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:11:26,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:11:26,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:11:26,936 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-10-12 18:11:27,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:11:27,820 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-10-12 18:11:27,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:11:27,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) Word has length 28 [2024-10-12 18:11:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:11:27,825 INFO L225 Difference]: With dead ends: 39 [2024-10-12 18:11:27,825 INFO L226 Difference]: Without dead ends: 31 [2024-10-12 18:11:27,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:11:27,828 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 18:11:27,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 41 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 18:11:27,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-12 18:11:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-12 18:11:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 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-10-12 18:11:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-12 18:11:27,834 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 28 [2024-10-12 18:11:27,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:11:27,835 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-12 18:11:27,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-10-12 18:11:27,835 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-10-12 18:11:27,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-12 18:11:27,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:11:27,836 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:11:27,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-12 18:11:28,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-10-12 18:11:28,041 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:11:28,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:11:28,042 INFO L85 PathProgramCache]: Analyzing trace with hash -380474989, now seen corresponding path program 1 times [2024-10-12 18:11:28,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:11:28,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403069870] [2024-10-12 18:11:28,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:11:28,042 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-10-12 18:11:28,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:11:28,044 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-10-12 18:11:28,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-12 18:11:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:11:28,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 18:11:28,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:11:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 18:11:28,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:11:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 18:11:28,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:11:28,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403069870] [2024-10-12 18:11:28,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403069870] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:11:28,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:11:28,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-12 18:11:28,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24114769] [2024-10-12 18:11:28,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:11:28,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 18:11:28,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:11:28,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 18:11:28,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:11:28,722 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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-10-12 18:11:32,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 18:11:33,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 18:11:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:11:34,421 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2024-10-12 18:11:34,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:11:34,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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) Word has length 30 [2024-10-12 18:11:34,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:11:34,426 INFO L225 Difference]: With dead ends: 46 [2024-10-12 18:11:34,426 INFO L226 Difference]: Without dead ends: 37 [2024-10-12 18:11:34,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-12 18:11:34,427 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 41 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-12 18:11:34,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 52 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-10-12 18:11:34,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-12 18:11:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-12 18:11:34,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 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-10-12 18:11:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-12 18:11:34,435 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 30 [2024-10-12 18:11:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:11:34,435 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-12 18:11:34,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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-10-12 18:11:34,435 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-12 18:11:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 18:11:34,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:11:34,437 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:11:34,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-12 18:11:34,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-10-12 18:11:34,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:11:34,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:11:34,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1821452577, now seen corresponding path program 2 times [2024-10-12 18:11:34,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:11:34,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477936997] [2024-10-12 18:11:34,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:11:34,639 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-10-12 18:11:34,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:11:34,640 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-10-12 18:11:34,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-12 18:11:34,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 18:11:34,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:11:34,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 18:11:34,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:11:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-12 18:11:34,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:11:34,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:11:34,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477936997] [2024-10-12 18:11:34,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477936997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:11:34,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:11:34,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:11:34,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083712678] [2024-10-12 18:11:34,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:11:34,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:11:34,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:11:34,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:11:34,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:11:34,829 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-10-12 18:11:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:11:35,851 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-10-12 18:11:35,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:11:35,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) Word has length 36 [2024-10-12 18:11:35,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:11:35,853 INFO L225 Difference]: With dead ends: 42 [2024-10-12 18:11:35,853 INFO L226 Difference]: Without dead ends: 38 [2024-10-12 18:11:35,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:11:35,854 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:11:35,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 18:11:35,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-12 18:11:35,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-12 18:11:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 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-10-12 18:11:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-10-12 18:11:35,861 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 36 [2024-10-12 18:11:35,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:11:35,862 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-10-12 18:11:35,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-10-12 18:11:35,862 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-10-12 18:11:35,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 18:11:35,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:11:35,863 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:11:35,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-12 18:11:36,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-10-12 18:11:36,064 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:11:36,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:11:36,065 INFO L85 PathProgramCache]: Analyzing trace with hash -606684640, now seen corresponding path program 1 times [2024-10-12 18:11:36,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:11:36,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136898221] [2024-10-12 18:11:36,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:11:36,065 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-10-12 18:11:36,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:11:36,067 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-10-12 18:11:36,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (8)] Waiting until timeout for monitored process [2024-10-12 18:11:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:11:36,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 18:11:36,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:11:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-12 18:11:36,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:11:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-12 18:11:37,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:11:37,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136898221] [2024-10-12 18:11:37,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136898221] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:11:37,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:11:37,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-12 18:11:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488989509] [2024-10-12 18:11:37,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:11:37,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:11:37,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:11:37,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:11:37,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:11:37,038 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-10-12 18:11:38,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 18:11:39,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:11:39,260 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-10-12 18:11:39,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:11:39,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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) Word has length 37 [2024-10-12 18:11:39,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:11:39,262 INFO L225 Difference]: With dead ends: 45 [2024-10-12 18:11:39,262 INFO L226 Difference]: Without dead ends: 41 [2024-10-12 18:11:39,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:11:39,263 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:11:39,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 18:11:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-12 18:11:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-12 18:11:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 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-10-12 18:11:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-10-12 18:11:39,276 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 37 [2024-10-12 18:11:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:11:39,277 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-10-12 18:11:39,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-10-12 18:11:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-10-12 18:11:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 18:11:39,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:11:39,281 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:11:39,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 (8)] Forceful destruction successful, exit code 0 [2024-10-12 18:11:39,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/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-10-12 18:11:39,482 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:11:39,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:11:39,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1609441055, now seen corresponding path program 2 times [2024-10-12 18:11:39,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:11:39,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199862762] [2024-10-12 18:11:39,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:11:39,483 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-10-12 18:11:39,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:11:39,486 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/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-10-12 18:11:39,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (9)] Waiting until timeout for monitored process [2024-10-12 18:11:45,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 18:11:45,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 18:11:45,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 18:11:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 18:11:46,814 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-12 18:11:46,814 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 18:11:46,815 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 18:11:46,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 (9)] Forceful destruction successful, exit code 0 [2024-10-12 18:11:47,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/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-10-12 18:11:47,020 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1] [2024-10-12 18:11:47,088 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 18:11:47,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 06:11:47 BoogieIcfgContainer [2024-10-12 18:11:47,092 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 18:11:47,093 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 18:11:47,093 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 18:11:47,093 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 18:11:47,094 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:11:22" (3/4) ... [2024-10-12 18:11:47,096 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 18:11:47,097 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 18:11:47,098 INFO L158 Benchmark]: Toolchain (without parser) took 27833.22ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 37.9MB in the beginning and 34.1MB in the end (delta: 3.8MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-10-12 18:11:47,098 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 48.2MB. Free memory was 28.5MB in the beginning and 28.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:11:47,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1020.64ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 37.7MB in the beginning and 46.2MB in the end (delta: -8.5MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-10-12 18:11:47,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.25ms. Allocated memory is still 88.1MB. Free memory was 46.2MB in the beginning and 42.9MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 18:11:47,099 INFO L158 Benchmark]: Boogie Preprocessor took 62.59ms. Allocated memory is still 88.1MB. Free memory was 42.9MB in the beginning and 39.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:11:47,099 INFO L158 Benchmark]: RCFGBuilder took 1601.19ms. Allocated memory is still 88.1MB. Free memory was 39.9MB in the beginning and 44.3MB in the end (delta: -4.4MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2024-10-12 18:11:47,099 INFO L158 Benchmark]: TraceAbstraction took 25041.03ms. Allocated memory is still 88.1MB. Free memory was 43.6MB in the beginning and 34.8MB in the end (delta: 8.8MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-10-12 18:11:47,099 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 88.1MB. Free memory is still 34.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:11:47,102 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.26ms. Allocated memory is still 48.2MB. Free memory was 28.5MB in the beginning and 28.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1020.64ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 37.7MB in the beginning and 46.2MB in the end (delta: -8.5MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.25ms. Allocated memory is still 88.1MB. Free memory was 46.2MB in the beginning and 42.9MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.59ms. Allocated memory is still 88.1MB. Free memory was 42.9MB in the beginning and 39.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1601.19ms. Allocated memory is still 88.1MB. Free memory was 39.9MB in the beginning and 44.3MB in the end (delta: -4.4MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * TraceAbstraction took 25041.03ms. Allocated memory is still 88.1MB. Free memory was 43.6MB in the beginning and 34.8MB in the end (delta: 8.8MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 88.1MB. Free memory is still 34.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 878]: 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 expf at line 854, overapproximation of __builtin_isinf_sign at line 871. Possible FailurePath: [L863] float x[4], y[4]; [L864] x[0] = __VERIFIER_nondet_float() [L865] x[1] = __VERIFIER_nondet_float() [L866] x[2] = __VERIFIER_nondet_float() [L867] x[3] = __VERIFIER_nondet_float() [L868] EXPR x[0] [L868] COND FALSE !(!(!__builtin_isnan (x[0]) && !__builtin_isinf_sign (x[0]))) [L869] EXPR x[1] [L869] COND FALSE !(!(!__builtin_isnan (x[1]) && !__builtin_isinf_sign (x[1]))) [L870] EXPR x[2] [L870] COND FALSE !(!(!__builtin_isnan (x[2]) && !__builtin_isinf_sign (x[2]))) [L871] EXPR x[3] [L871] COND FALSE !(!(!__builtin_isnan (x[3]) && !__builtin_isinf_sign (x[3]))) [L872] CALL softmax(x, y, 4) [L847] int i; [L848] EXPR x[0] [L848] float max = x[0]; [L849] i = 1 VAL [i=1, max=0.0, n=4, x={-2147483646:0}, y={3:0}] [L849] COND TRUE i < n [L850] EXPR x[i] [L850] COND TRUE x[i] > max [L851] EXPR x[i] [L851] max = x[i] VAL [i=1, max=2.0, n=4, x={-2147483646:0}, y={3:0}] [L849] ++i VAL [i=2, max=2.0, n=4, x={-2147483646:0}, y={3:0}] [L849] COND TRUE i < n [L850] EXPR x[i] [L850] COND TRUE x[i] > max [L851] EXPR x[i] [L851] max = x[i] VAL [i=2, max=36893488147419103000, n=4, x={-2147483646:0}, y={3:0}] [L849] ++i VAL [i=3, max=36893488147419103000, n=4, x={-2147483646:0}, y={3:0}] [L849] COND TRUE i < n [L850] EXPR x[i] [L850] COND TRUE x[i] > max [L851] EXPR x[i] [L851] max = x[i] VAL [i=3, max=158456325028528680000000000000, n=4, x={-2147483646:0}, y={3:0}] [L849] ++i VAL [i=4, max=158456325028528680000000000000, n=4, x={-2147483646:0}, y={3:0}] [L849] COND FALSE !(i < n) VAL [max=158456325028528680000000000000, n=4, x={-2147483646:0}, y={3:0}] [L852] float sum = 0.0f; [L853] i = 0 VAL [i=0, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483646:0}, y={3:0}] [L853] COND TRUE i < n [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=1, max=158456325028528680000000000000, n=4, sum=-0.000000000000000000000000000000000000000011479437019748901, x={-2147483646:0}, y={3:0}] [L853] COND TRUE i < n [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=2, max=158456325028528680000000000000, n=4, sum=256.0, x={-2147483646:0}, y={3:0}] [L853] COND TRUE i < n [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=3, max=158456325028528680000000000000, n=4, sum=-0.7265625, x={-2147483646:0}, y={3:0}] [L853] COND TRUE i < n [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=4, max=158456325028528680000000000000, n=4, sum=-0.7315483093261719, x={-2147483646:0}, y={3:0}] [L853] COND FALSE !(i < n) VAL [max=158456325028528680000000000000, n=4, sum=-0.7315483093261719, x={-2147483646:0}, y={3:0}] [L858] i = 0 VAL [i=0, max=158456325028528680000000000000, n=4, sum=-0.7315483093261719, x={-2147483646:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=1, max=158456325028528680000000000000, n=4, sum=-0.7315483093261719, x={-2147483646:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=2, max=158456325028528680000000000000, n=4, sum=-0.7315483093261719, x={-2147483646:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=3, max=158456325028528680000000000000, n=4, sum=-0.7315483093261719, x={-2147483646:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=4, max=158456325028528680000000000000, n=4, sum=-0.7315483093261719, x={-2147483646:0}, y={3:0}] [L858] COND FALSE !(i < n) VAL [max=158456325028528680000000000000, sum=-0.7315483093261719, x={-2147483646:0}, y={3:0}] [L872] RET softmax(x, y, 4) [L873] int i; [L874] float sum = 0.0f; [L875] i = 0 VAL [i=0, sum=0.0, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] [L875] ++i VAL [i=1, sum=0.000000000000000000000000000000000000000015691740203509302, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] [L875] ++i VAL [i=2, sum=-349.9427185058594, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] [L875] ++i VAL [i=3, sum=0.9931640625, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] [L875] ++i VAL [i=4, sum=0.9999794960021973, y={3:0}] [L875] COND FALSE !(i < 4) VAL [sum=0.9999794960021973, y={3:0}] [L877] float diff = fabsf(sum - 1.0f); VAL [diff=0.000020503997802734375, y={3:0}] [L878] COND TRUE !(__builtin_islessequal(diff, 1e-5f)) VAL [y={3:0}] [L878] reach_error() VAL [y={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.9s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 347 SdHoareTripleChecker+Invalid, 12.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 207 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 188 IncrementalHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 140 mSDtfsCounter, 188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 273 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=7, InterpolantAutomatonStates: 30, 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, 7 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 6.9s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 231 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 270 ConstructedInterpolants, 0 QuantifiedInterpolants, 416 SizeOfPredicates, 0 NumberOfNonLiveVariables, 624 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 134/140 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-10-12 18:11:47,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample