./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-78.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX --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 36e9a1ca1f60b89b4aed03be6500b09992e3d09beb8e46880b1b8574e3f964f1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:57:20,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:57:20,775 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:57:20,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:57:20,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:57:20,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:57:20,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:57:20,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:57:20,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:57:20,836 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:57:20,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:57:20,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:57:20,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:57:20,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:57:20,842 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:57:20,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:57:20,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:57:20,843 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:57:20,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:57:20,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:57:20,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:57:20,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:57:20,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:57:20,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:57:20,850 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:57:20,850 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:57:20,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:57:20,851 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:57:20,851 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:57:20,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:57:20,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:57:20,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:57:20,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:57:20,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:57:20,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:57:20,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:57:20,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:57:20,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:57:20,857 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:57:20,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:57:20,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:57:20,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:57:20,859 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX 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 -> 36e9a1ca1f60b89b4aed03be6500b09992e3d09beb8e46880b1b8574e3f964f1 [2024-11-08 18:57:21,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:57:21,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:57:21,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:57:21,282 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:57:21,282 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:57:21,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-78.i Unable to find full path for "g++" [2024-11-08 18:57:23,531 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:57:23,767 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:57:23,767 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-78.i [2024-11-08 18:57:23,779 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/data/66eb7a47b/fce0a99ad1eb4678a653e084f0ceea8c/FLAG0e8ae55fa [2024-11-08 18:57:23,806 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/data/66eb7a47b/fce0a99ad1eb4678a653e084f0ceea8c [2024-11-08 18:57:23,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:57:23,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:57:23,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:57:23,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:57:23,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:57:23,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:57:23" (1/1) ... [2024-11-08 18:57:23,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa08eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:23, skipping insertion in model container [2024-11-08 18:57:23,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:57:23" (1/1) ... [2024-11-08 18:57:23,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:57:24,074 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-78.i[919,932] [2024-11-08 18:57:24,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:57:24,225 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:57:24,244 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-78.i[919,932] [2024-11-08 18:57:24,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:57:24,319 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:57:24,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:24 WrapperNode [2024-11-08 18:57:24,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:57:24,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:57:24,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:57:24,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:57:24,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:24" (1/1) ... [2024-11-08 18:57:24,358 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:24" (1/1) ... [2024-11-08 18:57:24,439 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-11-08 18:57:24,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:57:24,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:57:24,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:57:24,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:57:24,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:24" (1/1) ... [2024-11-08 18:57:24,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:24" (1/1) ... [2024-11-08 18:57:24,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:24" (1/1) ... [2024-11-08 18:57:24,515 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:57:24,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:24" (1/1) ... [2024-11-08 18:57:24,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:24" (1/1) ... [2024-11-08 18:57:24,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:24" (1/1) ... [2024-11-08 18:57:24,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:24" (1/1) ... [2024-11-08 18:57:24,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:24" (1/1) ... [2024-11-08 18:57:24,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:24" (1/1) ... [2024-11-08 18:57:24,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:57:24,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:57:24,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:57:24,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:57:24,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:24" (1/1) ... [2024-11-08 18:57:24,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:57:24,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:24,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:24,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:57:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:57:24,653 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:57:24,654 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:57:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:57:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:57:24,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:57:24,809 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:57:24,814 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:57:25,519 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-08 18:57:25,519 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:57:25,534 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:57:25,534 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:57:25,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:57:25 BoogieIcfgContainer [2024-11-08 18:57:25,535 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:57:25,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:57:25,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:57:25,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:57:25,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:57:23" (1/3) ... [2024-11-08 18:57:25,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af51a49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:57:25, skipping insertion in model container [2024-11-08 18:57:25,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:24" (2/3) ... [2024-11-08 18:57:25,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af51a49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:57:25, skipping insertion in model container [2024-11-08 18:57:25,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:57:25" (3/3) ... [2024-11-08 18:57:25,545 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-78.i [2024-11-08 18:57:25,564 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:57:25,564 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:57:25,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:57:25,667 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;@4c85f574, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:57:25,668 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:57:25,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 18:57:25,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 18:57:25,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:25,687 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:57:25,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:25,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:25,694 INFO L85 PathProgramCache]: Analyzing trace with hash -801553431, now seen corresponding path program 1 times [2024-11-08 18:57:25,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:25,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120215803] [2024-11-08 18:57:25,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:25,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:57:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:57:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:57:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:57:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:57:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:57:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:57:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:57:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:57:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:57:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:57:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 18:57:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:57:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:57:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:57:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:57:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:57:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 18:57:26,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:26,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120215803] [2024-11-08 18:57:26,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120215803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:26,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:26,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:57:26,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013619896] [2024-11-08 18:57:26,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:26,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:57:26,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:26,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:57:26,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:57:26,295 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 18:57:26,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:26,351 INFO L93 Difference]: Finished difference Result 147 states and 244 transitions. [2024-11-08 18:57:26,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:57:26,353 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 123 [2024-11-08 18:57:26,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:26,365 INFO L225 Difference]: With dead ends: 147 [2024-11-08 18:57:26,366 INFO L226 Difference]: Without dead ends: 73 [2024-11-08 18:57:26,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:57:26,375 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:26,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:57:26,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-08 18:57:26,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-08 18:57:26,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 18:57:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2024-11-08 18:57:26,454 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 123 [2024-11-08 18:57:26,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:26,455 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2024-11-08 18:57:26,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 18:57:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2024-11-08 18:57:26,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 18:57:26,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:26,463 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:57:26,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:57:26,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:26,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:26,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1311849379, now seen corresponding path program 1 times [2024-11-08 18:57:26,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:26,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463642599] [2024-11-08 18:57:26,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:26,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:57:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:26,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:57:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:57:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:57:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:57:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:57:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:57:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:57:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:57:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:57:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:57:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 18:57:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:57:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:57:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:57:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:57:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:57:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 18:57:27,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:27,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463642599] [2024-11-08 18:57:27,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463642599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:27,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:27,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:57:27,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692723340] [2024-11-08 18:57:27,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:27,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:57:27,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:27,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:57:27,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:57:27,128 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:27,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:27,185 INFO L93 Difference]: Finished difference Result 143 states and 215 transitions. [2024-11-08 18:57:27,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:57:27,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2024-11-08 18:57:27,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:27,189 INFO L225 Difference]: With dead ends: 143 [2024-11-08 18:57:27,189 INFO L226 Difference]: Without dead ends: 73 [2024-11-08 18:57:27,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-11-08 18:57:27,194 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:27,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:57:27,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-08 18:57:27,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-08 18:57:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 18:57:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2024-11-08 18:57:27,225 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 123 [2024-11-08 18:57:27,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:27,227 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2024-11-08 18:57:27,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2024-11-08 18:57:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 18:57:27,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:27,234 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:57:27,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:57:27,234 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:27,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:27,235 INFO L85 PathProgramCache]: Analyzing trace with hash -314423158, now seen corresponding path program 1 times [2024-11-08 18:57:27,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:27,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310218770] [2024-11-08 18:57:27,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:27,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:57:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:57:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:57:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:57:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:57:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:57:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:57:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:57:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:57:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:57:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:57:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 18:57:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:57:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:57:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:57:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:57:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:57:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 18:57:27,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:27,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310218770] [2024-11-08 18:57:27,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310218770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:27,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:27,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:57:27,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774608694] [2024-11-08 18:57:27,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:27,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:57:27,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:27,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:57:27,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:57:27,966 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:28,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:28,326 INFO L93 Difference]: Finished difference Result 214 states and 319 transitions. [2024-11-08 18:57:28,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:57:28,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2024-11-08 18:57:28,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:28,332 INFO L225 Difference]: With dead ends: 214 [2024-11-08 18:57:28,332 INFO L226 Difference]: Without dead ends: 144 [2024-11-08 18:57:28,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:57:28,335 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 81 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:28,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 281 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:57:28,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-08 18:57:28,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2024-11-08 18:57:28,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 18:57:28,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 190 transitions. [2024-11-08 18:57:28,390 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 190 transitions. Word has length 124 [2024-11-08 18:57:28,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:28,392 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 190 transitions. [2024-11-08 18:57:28,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:28,393 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 190 transitions. [2024-11-08 18:57:28,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 18:57:28,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:28,396 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:57:28,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:57:28,397 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:28,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:28,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1749572040, now seen corresponding path program 1 times [2024-11-08 18:57:28,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:28,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085748853] [2024-11-08 18:57:28,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:28,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:57:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:57:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:57:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:57:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:57:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:57:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:57:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:57:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:57:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:57:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:57:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 18:57:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:57:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:57:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:57:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:57:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:57:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 18:57:28,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:28,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085748853] [2024-11-08 18:57:28,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085748853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:28,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:28,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:57:28,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129683215] [2024-11-08 18:57:28,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:28,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:57:28,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:28,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:57:28,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:57:28,893 INFO L87 Difference]: Start difference. First operand 127 states and 190 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:29,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:29,150 INFO L93 Difference]: Finished difference Result 305 states and 455 transitions. [2024-11-08 18:57:29,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:57:29,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2024-11-08 18:57:29,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:29,169 INFO L225 Difference]: With dead ends: 305 [2024-11-08 18:57:29,169 INFO L226 Difference]: Without dead ends: 220 [2024-11-08 18:57:29,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:57:29,177 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 121 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:29,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 308 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:57:29,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-08 18:57:29,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 202. [2024-11-08 18:57:29,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 144 states have (on average 1.3402777777777777) internal successors, (193), 144 states have internal predecessors, (193), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 18:57:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 301 transitions. [2024-11-08 18:57:29,245 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 301 transitions. Word has length 125 [2024-11-08 18:57:29,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:29,246 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 301 transitions. [2024-11-08 18:57:29,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:29,246 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 301 transitions. [2024-11-08 18:57:29,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 18:57:29,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:29,252 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:57:29,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:57:29,255 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:29,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:29,256 INFO L85 PathProgramCache]: Analyzing trace with hash 618519269, now seen corresponding path program 1 times [2024-11-08 18:57:29,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:29,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888506182] [2024-11-08 18:57:29,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:29,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:57:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:57:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:57:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:57:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:57:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:57:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:57:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:57:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:57:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:57:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:57:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 18:57:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:57:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:57:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:57:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:57:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:57:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 18:57:29,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:29,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888506182] [2024-11-08 18:57:29,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888506182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:29,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:29,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:57:29,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345408869] [2024-11-08 18:57:29,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:29,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:57:29,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:29,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:57:29,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:57:29,775 INFO L87 Difference]: Start difference. First operand 202 states and 301 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:30,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:30,296 INFO L93 Difference]: Finished difference Result 528 states and 784 transitions. [2024-11-08 18:57:30,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:57:30,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-11-08 18:57:30,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:30,305 INFO L225 Difference]: With dead ends: 528 [2024-11-08 18:57:30,309 INFO L226 Difference]: Without dead ends: 379 [2024-11-08 18:57:30,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:57:30,312 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 238 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:30,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 460 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:57:30,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-08 18:57:30,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 345. [2024-11-08 18:57:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 249 states have (on average 1.3493975903614457) internal successors, (336), 249 states have internal predecessors, (336), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 18:57:30,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 516 transitions. [2024-11-08 18:57:30,387 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 516 transitions. Word has length 126 [2024-11-08 18:57:30,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:30,388 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 516 transitions. [2024-11-08 18:57:30,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 516 transitions. [2024-11-08 18:57:30,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 18:57:30,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:30,392 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:57:30,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:57:30,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:30,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:30,393 INFO L85 PathProgramCache]: Analyzing trace with hash 225492259, now seen corresponding path program 1 times [2024-11-08 18:57:30,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:30,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009219976] [2024-11-08 18:57:30,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:30,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:30,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:30,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:57:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:30,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:57:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:30,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:57:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:30,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:57:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:30,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:57:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:30,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:57:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:30,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:57:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:30,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:57:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:30,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:57:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:30,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:57:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:30,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:57:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:30,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 18:57:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:30,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:57:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:30,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:57:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:30,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:57:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:30,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:57:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:57:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 18:57:31,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:31,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009219976] [2024-11-08 18:57:31,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009219976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:31,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:31,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:57:31,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254111414] [2024-11-08 18:57:31,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:31,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:57:31,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:31,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:57:31,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:57:31,017 INFO L87 Difference]: Start difference. First operand 345 states and 516 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:31,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:31,335 INFO L93 Difference]: Finished difference Result 680 states and 1013 transitions. [2024-11-08 18:57:31,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:57:31,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-11-08 18:57:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:31,342 INFO L225 Difference]: With dead ends: 680 [2024-11-08 18:57:31,343 INFO L226 Difference]: Without dead ends: 377 [2024-11-08 18:57:31,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:57:31,349 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 73 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:31,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 281 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:57:31,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-08 18:57:31,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 349. [2024-11-08 18:57:31,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 253 states have (on average 1.3399209486166008) internal successors, (339), 253 states have internal predecessors, (339), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 18:57:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 519 transitions. [2024-11-08 18:57:31,426 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 519 transitions. Word has length 126 [2024-11-08 18:57:31,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:31,427 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 519 transitions. [2024-11-08 18:57:31,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 519 transitions. [2024-11-08 18:57:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 18:57:31,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:31,430 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:57:31,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:57:31,430 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:31,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:31,431 INFO L85 PathProgramCache]: Analyzing trace with hash 826344963, now seen corresponding path program 1 times [2024-11-08 18:57:31,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:31,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345575776] [2024-11-08 18:57:31,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:31,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:57:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:57:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:57:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:57:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:57:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:57:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:57:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:57:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:57:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:57:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:57:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 18:57:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:57:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:57:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:57:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:57:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:57:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 18:57:32,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:32,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345575776] [2024-11-08 18:57:32,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345575776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:32,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:32,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:57:32,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965549023] [2024-11-08 18:57:32,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:32,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:57:32,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:32,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:57:32,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:57:32,012 INFO L87 Difference]: Start difference. First operand 349 states and 519 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:32,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:32,351 INFO L93 Difference]: Finished difference Result 921 states and 1371 transitions. [2024-11-08 18:57:32,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:57:32,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-08 18:57:32,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:32,359 INFO L225 Difference]: With dead ends: 921 [2024-11-08 18:57:32,360 INFO L226 Difference]: Without dead ends: 618 [2024-11-08 18:57:32,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:57:32,364 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 116 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:32,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 340 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:57:32,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-08 18:57:32,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 516. [2024-11-08 18:57:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 382 states have (on average 1.337696335078534) internal successors, (511), 382 states have internal predecessors, (511), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-08 18:57:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 763 transitions. [2024-11-08 18:57:32,515 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 763 transitions. Word has length 127 [2024-11-08 18:57:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:32,517 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 763 transitions. [2024-11-08 18:57:32,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 763 transitions. [2024-11-08 18:57:32,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 18:57:32,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:32,521 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:57:32,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:57:32,522 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:32,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:32,522 INFO L85 PathProgramCache]: Analyzing trace with hash -184772287, now seen corresponding path program 1 times [2024-11-08 18:57:32,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:32,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774463273] [2024-11-08 18:57:32,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:32,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:57:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:57:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:57:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:57:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:57:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:57:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:57:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:57:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:57:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:57:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:57:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 18:57:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:57:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:57:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:57:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:57:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:57:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 18:57:32,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:32,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774463273] [2024-11-08 18:57:32,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774463273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:32,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:32,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:57:32,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541204178] [2024-11-08 18:57:32,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:32,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:57:32,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:32,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:57:32,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:57:32,975 INFO L87 Difference]: Start difference. First operand 516 states and 763 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:33,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:33,172 INFO L93 Difference]: Finished difference Result 1062 states and 1579 transitions. [2024-11-08 18:57:33,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:57:33,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-08 18:57:33,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:33,178 INFO L225 Difference]: With dead ends: 1062 [2024-11-08 18:57:33,178 INFO L226 Difference]: Without dead ends: 632 [2024-11-08 18:57:33,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:57:33,181 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 67 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:33,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 301 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:57:33,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-08 18:57:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 562. [2024-11-08 18:57:33,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 428 states have (on average 1.341121495327103) internal successors, (574), 428 states have internal predecessors, (574), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-08 18:57:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 826 transitions. [2024-11-08 18:57:33,294 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 826 transitions. Word has length 127 [2024-11-08 18:57:33,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:33,295 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 826 transitions. [2024-11-08 18:57:33,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 826 transitions. [2024-11-08 18:57:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 18:57:33,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:33,298 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:57:33,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:57:33,298 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:33,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:33,299 INFO L85 PathProgramCache]: Analyzing trace with hash 205918306, now seen corresponding path program 1 times [2024-11-08 18:57:33,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:33,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861325078] [2024-11-08 18:57:33,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:33,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 18:57:33,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [466052996] [2024-11-08 18:57:33,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:33,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:57:33,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:33,468 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:57:33,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:57:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:33,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:57:33,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:57:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 18:57:34,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:57:34,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:34,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861325078] [2024-11-08 18:57:34,059 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 18:57:34,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466052996] [2024-11-08 18:57:34,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466052996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:34,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:34,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:57:34,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947918583] [2024-11-08 18:57:34,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:34,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:57:34,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:34,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:57:34,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:57:34,061 INFO L87 Difference]: Start difference. First operand 562 states and 826 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:34,594 INFO L93 Difference]: Finished difference Result 1328 states and 1939 transitions. [2024-11-08 18:57:34,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:57:34,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 132 [2024-11-08 18:57:34,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:34,602 INFO L225 Difference]: With dead ends: 1328 [2024-11-08 18:57:34,602 INFO L226 Difference]: Without dead ends: 981 [2024-11-08 18:57:34,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 129 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-11-08 18:57:34,605 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 94 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:34,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 246 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:57:34,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2024-11-08 18:57:34,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 973. [2024-11-08 18:57:34,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 750 states have (on average 1.3333333333333333) internal successors, (1000), 754 states have internal predecessors, (1000), 206 states have call successors, (206), 16 states have call predecessors, (206), 16 states have return successors, (206), 202 states have call predecessors, (206), 206 states have call successors, (206) [2024-11-08 18:57:34,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1412 transitions. [2024-11-08 18:57:34,755 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1412 transitions. Word has length 132 [2024-11-08 18:57:34,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:34,756 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1412 transitions. [2024-11-08 18:57:34,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:34,757 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1412 transitions. [2024-11-08 18:57:34,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 18:57:34,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:34,759 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:57:34,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 18:57:34,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:57:34,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:34,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:34,963 INFO L85 PathProgramCache]: Analyzing trace with hash 628620132, now seen corresponding path program 1 times [2024-11-08 18:57:34,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:34,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419062781] [2024-11-08 18:57:34,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:34,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 18:57:35,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1797148899] [2024-11-08 18:57:35,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:35,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:57:35,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:35,125 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:57:35,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:57:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:35,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:57:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:35,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:57:35,611 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:57:35,612 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:57:35,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 18:57:35,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 18:57:35,820 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:57:35,975 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:57:35,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:57:35 BoogieIcfgContainer [2024-11-08 18:57:35,982 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:57:35,983 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:57:35,983 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:57:35,983 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:57:35,984 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:57:25" (3/4) ... [2024-11-08 18:57:35,988 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:57:35,989 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:57:35,990 INFO L158 Benchmark]: Toolchain (without parser) took 12179.80ms. Allocated memory was 140.5MB in the beginning and 209.7MB in the end (delta: 69.2MB). Free memory was 105.5MB in the beginning and 148.7MB in the end (delta: -43.2MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2024-11-08 18:57:35,991 INFO L158 Benchmark]: CDTParser took 1.47ms. Allocated memory is still 94.4MB. Free memory was 72.5MB in the beginning and 72.4MB in the end (delta: 73.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:57:35,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.31ms. Allocated memory is still 140.5MB. Free memory was 105.5MB in the beginning and 88.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 18:57:35,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.65ms. Allocated memory is still 140.5MB. Free memory was 88.3MB in the beginning and 81.6MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 18:57:35,992 INFO L158 Benchmark]: Boogie Preprocessor took 124.33ms. Allocated memory is still 140.5MB. Free memory was 81.6MB in the beginning and 70.0MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 18:57:35,993 INFO L158 Benchmark]: RCFGBuilder took 969.55ms. Allocated memory is still 140.5MB. Free memory was 70.0MB in the beginning and 94.7MB in the end (delta: -24.7MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-11-08 18:57:35,993 INFO L158 Benchmark]: TraceAbstraction took 10444.95ms. Allocated memory was 140.5MB in the beginning and 209.7MB in the end (delta: 69.2MB). Free memory was 94.1MB in the beginning and 148.7MB in the end (delta: -54.6MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-11-08 18:57:35,994 INFO L158 Benchmark]: Witness Printer took 6.70ms. Allocated memory is still 209.7MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:57:35,997 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.47ms. Allocated memory is still 94.4MB. Free memory was 72.5MB in the beginning and 72.4MB in the end (delta: 73.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 507.31ms. Allocated memory is still 140.5MB. Free memory was 105.5MB in the beginning and 88.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.65ms. Allocated memory is still 140.5MB. Free memory was 88.3MB in the beginning and 81.6MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 124.33ms. Allocated memory is still 140.5MB. Free memory was 81.6MB in the beginning and 70.0MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 969.55ms. Allocated memory is still 140.5MB. Free memory was 70.0MB in the beginning and 94.7MB in the end (delta: -24.7MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10444.95ms. Allocated memory was 140.5MB in the beginning and 209.7MB in the end (delta: 69.2MB). Free memory was 94.1MB in the beginning and 148.7MB in the end (delta: -54.6MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Witness Printer took 6.70ms. Allocated memory is still 209.7MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of bitwiseOr at line 115, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char last_1_var_1_3 = 64; [L42] unsigned short int last_1_var_1_6 = 10; [L43] unsigned short int last_1_var_1_15 = 5; [L44] unsigned short int last_1_var_1_20 = 50; [L45] unsigned short int last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] CALL updateLastVariables() [L108] last_1_var_1_3 = var_1_3 [L109] last_1_var_1_6 = var_1_6 [L110] last_1_var_1_15 = var_1_15 [L111] last_1_var_1_20 = var_1_20 [L112] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L122] RET updateLastVariables() [L123] CALL updateVariables() [L77] var_1_4 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L78] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L79] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L79] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L80] var_1_5 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L81] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L82] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L82] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L83] var_1_9 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L84] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L85] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L85] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L86] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L86] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L87] var_1_10 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L88] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L89] var_1_11 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L90] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L91] var_1_12 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L92] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L93] var_1_13 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L94] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L95] var_1_14 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L96] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L97] var_1_17 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L98] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L99] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L99] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L100] var_1_18 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L101] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L102] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L102] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L103] var_1_19 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L104] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L105] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L105] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L123] RET updateVariables() [L124] CALL step() [L49] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L49] COND FALSE !((last_1_var_1_20 ^ last_1_var_1_15) < -256) [L52] COND FALSE !(var_1_5 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L56] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L57] COND FALSE !(last_1_var_1_6 < last_1_var_1_21) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L60] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L61] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L67] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L68] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=0, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L69] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=0, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L69] COND FALSE !(var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L72] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L73] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L115] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L115] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L115] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L115-L116] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 10, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 790 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 790 mSDsluCounter, 2534 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1561 mSDsCounter, 320 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 409 IncrementalHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 320 mSolverCounterUnsat, 973 mSDtfsCounter, 409 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 484 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=973occurred in iteration=9, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 277 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1529 NumberOfCodeBlocks, 1529 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1124 ConstructedInterpolants, 0 QuantifiedInterpolants, 3166 SizeOfPredicates, 4 NumberOfNonLiveVariables, 315 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 5508/5508 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 18:57:36,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-78.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX --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 36e9a1ca1f60b89b4aed03be6500b09992e3d09beb8e46880b1b8574e3f964f1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:57:39,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:57:39,186 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 18:57:39,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:57:39,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:57:39,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:57:39,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:57:39,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:57:39,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:57:39,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:57:39,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:57:39,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:57:39,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:57:39,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:57:39,262 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:57:39,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:57:39,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:57:39,263 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:57:39,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:57:39,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:57:39,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:57:39,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:57:39,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:57:39,267 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:57:39,268 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:57:39,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:57:39,268 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:57:39,269 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:57:39,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:57:39,269 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:57:39,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:57:39,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:57:39,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:57:39,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:57:39,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:57:39,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:57:39,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:57:39,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:57:39,274 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:57:39,274 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:57:39,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:57:39,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:57:39,276 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:57:39,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:57:39,295 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX 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 -> 36e9a1ca1f60b89b4aed03be6500b09992e3d09beb8e46880b1b8574e3f964f1 [2024-11-08 18:57:39,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:57:39,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:57:39,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:57:39,863 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:57:39,863 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:57:39,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-78.i Unable to find full path for "g++" [2024-11-08 18:57:42,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:57:42,907 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:57:42,908 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-78.i [2024-11-08 18:57:42,932 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/data/a9792b09c/b51825090fcb42f29daef4089d49885d/FLAG233f4176e [2024-11-08 18:57:42,959 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/data/a9792b09c/b51825090fcb42f29daef4089d49885d [2024-11-08 18:57:42,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:57:42,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:57:42,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:57:42,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:57:42,977 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:57:42,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:57:42" (1/1) ... [2024-11-08 18:57:42,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3efbaa50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:42, skipping insertion in model container [2024-11-08 18:57:42,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:57:42" (1/1) ... [2024-11-08 18:57:43,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:57:43,351 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-78.i[919,932] [2024-11-08 18:57:43,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:57:43,512 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:57:43,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-78.i[919,932] [2024-11-08 18:57:43,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:57:43,628 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:57:43,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:43 WrapperNode [2024-11-08 18:57:43,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:57:43,631 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:57:43,631 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:57:43,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:57:43,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:43" (1/1) ... [2024-11-08 18:57:43,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:43" (1/1) ... [2024-11-08 18:57:43,716 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-11-08 18:57:43,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:57:43,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:57:43,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:57:43,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:57:43,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:43" (1/1) ... [2024-11-08 18:57:43,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:43" (1/1) ... [2024-11-08 18:57:43,750 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:43" (1/1) ... [2024-11-08 18:57:43,794 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:57:43,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:43" (1/1) ... [2024-11-08 18:57:43,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:43" (1/1) ... [2024-11-08 18:57:43,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:43" (1/1) ... [2024-11-08 18:57:43,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:43" (1/1) ... [2024-11-08 18:57:43,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:43" (1/1) ... [2024-11-08 18:57:43,873 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:43" (1/1) ... [2024-11-08 18:57:43,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:57:43,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:57:43,888 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:57:43,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:57:43,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:43" (1/1) ... [2024-11-08 18:57:43,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:57:43,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:43,938 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:43,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:57:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:57:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:57:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:57:43,980 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:57:43,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:57:43,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:57:44,077 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:57:44,080 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:57:48,544 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 18:57:48,544 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:57:48,557 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:57:48,558 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:57:48,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:57:48 BoogieIcfgContainer [2024-11-08 18:57:48,558 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:57:48,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:57:48,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:57:48,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:57:48,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:57:42" (1/3) ... [2024-11-08 18:57:48,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324cc701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:57:48, skipping insertion in model container [2024-11-08 18:57:48,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:43" (2/3) ... [2024-11-08 18:57:48,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324cc701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:57:48, skipping insertion in model container [2024-11-08 18:57:48,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:57:48" (3/3) ... [2024-11-08 18:57:48,574 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-78.i [2024-11-08 18:57:48,592 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:57:48,592 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:57:48,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:57:48,656 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;@3118d2c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:57:48,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:57:48,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 18:57:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 18:57:48,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:48,673 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:57:48,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:48,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:48,678 INFO L85 PathProgramCache]: Analyzing trace with hash 755570282, now seen corresponding path program 1 times [2024-11-08 18:57:48,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:57:48,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812349795] [2024-11-08 18:57:48,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:48,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:57:48,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:57:48,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:57:48,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 18:57:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:49,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 18:57:49,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:57:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 18:57:49,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:57:49,289 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:57:49,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812349795] [2024-11-08 18:57:49,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812349795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:49,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:49,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:57:49,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111227281] [2024-11-08 18:57:49,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:49,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:57:49,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:57:49,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:57:49,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:57:49,323 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:49,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:49,362 INFO L93 Difference]: Finished difference Result 107 states and 180 transitions. [2024-11-08 18:57:49,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:57:49,364 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2024-11-08 18:57:49,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:49,376 INFO L225 Difference]: With dead ends: 107 [2024-11-08 18:57:49,376 INFO L226 Difference]: Without dead ends: 53 [2024-11-08 18:57:49,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:57:49,385 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:49,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:57:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-08 18:57:49,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-08 18:57:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 18:57:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2024-11-08 18:57:49,448 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 117 [2024-11-08 18:57:49,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:49,452 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2024-11-08 18:57:49,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2024-11-08 18:57:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 18:57:49,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:49,457 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:57:49,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/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)] Forceful destruction successful, exit code 0 [2024-11-08 18:57:49,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:57:49,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:49,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:49,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1990222348, now seen corresponding path program 1 times [2024-11-08 18:57:49,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:57:49,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169468715] [2024-11-08 18:57:49,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:49,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:57:49,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:57:49,662 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:57:49,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 18:57:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:50,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 18:57:50,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:57:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 18:57:51,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:57:51,295 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:57:51,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169468715] [2024-11-08 18:57:51,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169468715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:51,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:51,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:57:51,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859621409] [2024-11-08 18:57:51,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:51,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:57:51,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:57:51,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:57:51,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:57:51,304 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:57:55,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:57:58,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:58:02,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:58:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:02,201 INFO L93 Difference]: Finished difference Result 161 states and 231 transitions. [2024-11-08 18:58:02,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:58:02,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-08 18:58:02,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:02,236 INFO L225 Difference]: With dead ends: 161 [2024-11-08 18:58:02,236 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 18:58:02,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:58:02,238 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 54 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:02,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 215 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 13 Invalid, 2 Unknown, 0 Unchecked, 10.8s Time] [2024-11-08 18:58:02,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 18:58:02,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 101. [2024-11-08 18:58:02,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 18:58:02,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2024-11-08 18:58:02,269 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 118 [2024-11-08 18:58:02,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:02,270 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2024-11-08 18:58:02,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:58:02,271 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2024-11-08 18:58:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 18:58:02,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:02,273 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:58:02,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 18:58:02,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:58:02,474 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:02,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:02,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1310163978, now seen corresponding path program 1 times [2024-11-08 18:58:02,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:58:02,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351437375] [2024-11-08 18:58:02,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:02,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:58:02,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:58:02,483 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:58:02,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 18:58:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:03,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 18:58:03,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:58:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 18:58:05,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:58:05,383 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:58:05,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351437375] [2024-11-08 18:58:05,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351437375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:05,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:05,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:58:05,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599131200] [2024-11-08 18:58:05,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:05,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:58:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:58:05,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:58:05,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:58:05,389 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:58:07,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:58:09,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:58:14,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:58:15,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:58:19,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:58:22,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:58:26,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:58:26,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:26,241 INFO L93 Difference]: Finished difference Result 272 states and 391 transitions. [2024-11-08 18:58:26,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:58:26,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-08 18:58:26,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:26,245 INFO L225 Difference]: With dead ends: 272 [2024-11-08 18:58:26,245 INFO L226 Difference]: Without dead ends: 222 [2024-11-08 18:58:26,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:58:26,248 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 135 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:26,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 213 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 155 Invalid, 1 Unknown, 0 Unchecked, 20.6s Time] [2024-11-08 18:58:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-08 18:58:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 186. [2024-11-08 18:58:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 109 states have (on average 1.1743119266055047) internal successors, (128), 109 states have internal predecessors, (128), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-08 18:58:26,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 272 transitions. [2024-11-08 18:58:26,295 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 272 transitions. Word has length 118 [2024-11-08 18:58:26,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:26,296 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 272 transitions. [2024-11-08 18:58:26,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:58:26,296 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 272 transitions. [2024-11-08 18:58:26,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 18:58:26,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:26,299 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:58:26,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 18:58:26,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:58:26,500 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:26,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:26,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1252905676, now seen corresponding path program 1 times [2024-11-08 18:58:26,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:58:26,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055520694] [2024-11-08 18:58:26,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:26,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:58:26,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:58:26,505 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:58:26,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 18:58:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:27,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:58:27,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:58:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-08 18:58:29,921 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:58:32,875 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:58:32,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055520694] [2024-11-08 18:58:32,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055520694] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:58:32,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287244670] [2024-11-08 18:58:32,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:32,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:58:32,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:58:32,884 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:58:32,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 18:58:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:33,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 18:58:33,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:58:35,310 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 18:58:35,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:58:35,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287244670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:35,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:58:35,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-08 18:58:35,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700546403] [2024-11-08 18:58:35,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:35,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:58:35,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:58:35,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:58:35,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:58:35,318 INFO L87 Difference]: Start difference. First operand 186 states and 272 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:58:38,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:58:42,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:58:46,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:58:48,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:58:51,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:58:55,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:58:57,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:58:58,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:58,006 INFO L93 Difference]: Finished difference Result 448 states and 641 transitions. [2024-11-08 18:58:58,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:58:58,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-08 18:58:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:58,012 INFO L225 Difference]: With dead ends: 448 [2024-11-08 18:58:58,013 INFO L226 Difference]: Without dead ends: 302 [2024-11-08 18:58:58,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:58:58,016 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 43 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:58,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 164 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 22.6s Time] [2024-11-08 18:58:58,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-08 18:58:58,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 295. [2024-11-08 18:58:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 189 states have (on average 1.2010582010582012) internal successors, (227), 192 states have internal predecessors, (227), 96 states have call successors, (96), 9 states have call predecessors, (96), 9 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-08 18:58:58,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 419 transitions. [2024-11-08 18:58:58,109 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 419 transitions. Word has length 118 [2024-11-08 18:58:58,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:58,113 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 419 transitions. [2024-11-08 18:58:58,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:58:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 419 transitions. [2024-11-08 18:58:58,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 18:58:58,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:58,120 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:58:58,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 18:58:58,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 18:58:58,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:58:58,525 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:58,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:58,525 INFO L85 PathProgramCache]: Analyzing trace with hash -609099400, now seen corresponding path program 1 times [2024-11-08 18:58:58,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:58:58,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736005501] [2024-11-08 18:58:58,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:58,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:58:58,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:58:58,530 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:58:58,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/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-11-08 18:58:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:59,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 18:58:59,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:59:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 18:59:00,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:59:00,936 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:59:00,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736005501] [2024-11-08 18:59:00,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736005501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:59:00,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:59:00,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:59:00,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652314906] [2024-11-08 18:59:00,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:59:00,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:59:00,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:59:00,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:59:00,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:59:00,940 INFO L87 Difference]: Start difference. First operand 295 states and 419 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:59:03,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:59:07,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:59:09,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:59:12,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:59:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:59:12,597 INFO L93 Difference]: Finished difference Result 462 states and 661 transitions. [2024-11-08 18:59:12,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:59:12,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-08 18:59:12,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:59:12,603 INFO L225 Difference]: With dead ends: 462 [2024-11-08 18:59:12,604 INFO L226 Difference]: Without dead ends: 345 [2024-11-08 18:59:12,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 116 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-11-08 18:59:12,606 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:59:12,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 138 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 11.6s Time] [2024-11-08 18:59:12,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-08 18:59:12,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 295. [2024-11-08 18:59:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 189 states have (on average 1.2010582010582012) internal successors, (227), 192 states have internal predecessors, (227), 96 states have call successors, (96), 9 states have call predecessors, (96), 9 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-08 18:59:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 419 transitions. [2024-11-08 18:59:12,668 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 419 transitions. Word has length 118 [2024-11-08 18:59:12,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:59:12,669 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 419 transitions. [2024-11-08 18:59:12,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 18:59:12,669 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 419 transitions. [2024-11-08 18:59:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 18:59:12,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:59:12,671 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:59:12,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/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-11-08 18:59:12,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:59:12,873 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:59:12,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:59:12,873 INFO L85 PathProgramCache]: Analyzing trace with hash -551841098, now seen corresponding path program 1 times [2024-11-08 18:59:12,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:59:12,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849054522] [2024-11-08 18:59:12,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:59:12,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:59:12,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:59:12,876 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:59:12,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1fe3a63-dded-4c54-b9ff-4ae941032782/bin/uautomizer-verify-jihMAELWvX/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-11-08 18:59:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:13,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-08 18:59:13,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:00:09,561 WARN L286 SmtUtils]: Spent 7.00s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:00:17,641 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:00:24,058 WARN L286 SmtUtils]: Spent 6.42s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:00:30,900 WARN L286 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:00:39,014 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:00:46,084 WARN L286 SmtUtils]: Spent 7.07s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:00:54,176 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:01:02,101 WARN L286 SmtUtils]: Spent 7.92s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:01:10,166 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:01:22,724 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:01:30,822 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:01:36,772 WARN L286 SmtUtils]: Spent 5.95s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:01:44,854 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:01:51,955 WARN L286 SmtUtils]: Spent 7.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:01:59,506 WARN L286 SmtUtils]: Spent 7.53s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:02:07,231 WARN L286 SmtUtils]: Spent 7.72s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:02:15,349 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:02:23,443 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:02:28,782 WARN L286 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:02:36,102 WARN L286 SmtUtils]: Spent 7.32s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:02:44,208 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:02:52,308 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:03:00,472 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:03:08,541 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:03:16,709 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:03:24,811 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:03:32,951 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:03:41,115 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:03:49,211 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:04:01,152 WARN L286 SmtUtils]: Spent 7.64s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:04:05,194 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_19~0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (.cse6 ((_ zero_extend 24) c_~var_1_5~0)) (.cse8 ((_ sign_extend 24) c_~var_1_17~0)) (.cse2 ((_ sign_extend 24) c_~var_1_18~0))) (and (bvsge .cse0 (_ bv4294967265 32)) (fp.geq c_~var_1_10~0 .cse1) (bvsle .cse2 (_ bv32 32)) (let ((.cse4 (bvadd (_ bv10 32) .cse6)) (.cse5 ((_ zero_extend 24) c_~var_1_4~0))) (let ((.cse3 (bvsgt .cse4 .cse5))) (or (and .cse3 (= ((_ extract 15 0) .cse4) c_~var_1_20~0)) (and (= ((_ extract 15 0) .cse5) c_~var_1_20~0) (not .cse3))))) (= (_ bv0 16) c_~var_1_21~0) (fp.leq c_~var_1_12~0 .cse7) (fp.geq c_~var_1_14~0 .cse1) (bvsle .cse0 (_ bv31 32)) (fp.leq c_~var_1_14~0 .cse7) (fp.geq c_~var_1_13~0 .cse1) (fp.geq c_~var_1_12~0 .cse1) (fp.leq c_~var_1_13~0 .cse7) (fp.leq c_~var_1_10~0 .cse7) (bvsge .cse8 (_ bv4294967233 32)) (let ((.cse9 (fp.gt c_~var_1_10~0 c_~var_1_11~0)) (.cse10 (fp.sub c_currentRoundingMode c_~var_1_13~0 c_~var_1_14~0))) (or (and .cse9 (= c_~var_1_8~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_10~0 c_~var_1_12~0) .cse10))) (and (not .cse9) (= c_~var_1_8~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_11~0 c_~var_1_12~0) .cse10))))) (fp.leq c_~var_1_11~0 .cse7) (fp.geq c_~var_1_11~0 .cse1) (bvslt (_ bv64 32) (bvsrem .cse6 c_~var_1_9~0)) (not (bvsgt (_ bv32 32) c_~var_1_9~0)) (bvsle .cse8 (_ bv63 32)) (= c_~var_1_3~0 (_ bv64 8)) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv10 16) c_~var_1_6~0) (= (_ bv0 16) c_~last_1_var_1_21~0) (bvsge .cse2 (_ bv4294967265 32)))) is different from false [2024-11-08 19:04:12,416 WARN L286 SmtUtils]: Spent 7.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:04:20,586 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:04:28,698 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:04:36,807 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:04:44,890 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:04:51,768 WARN L286 SmtUtils]: Spent 6.88s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:04:59,868 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:05:07,781 WARN L286 SmtUtils]: Spent 7.91s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:05:15,964 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:05:24,077 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:05:32,191 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:05:40,276 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:05:48,373 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:05:56,488 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:04,603 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:12,796 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:20,899 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:29,012 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:36,539 WARN L286 SmtUtils]: Spent 7.53s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:44,678 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:52,793 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:00,961 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:09,103 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:17,196 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:25,318 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:33,433 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:41,547 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:49,681 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:57,861 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:05,971 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:14,134 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:22,246 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:30,392 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:38,495 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:46,659 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:54,786 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:09:02,933 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:09:11,096 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:09:19,195 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:09:23,233 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_19~0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (.cse6 ((_ zero_extend 24) c_~var_1_5~0)) (.cse8 ((_ sign_extend 24) c_~var_1_17~0)) (.cse2 ((_ sign_extend 24) c_~var_1_18~0))) (and (bvsge .cse0 (_ bv4294967265 32)) (fp.geq c_~var_1_10~0 .cse1) (bvsle .cse2 (_ bv32 32)) (let ((.cse4 (bvadd (_ bv10 32) .cse6)) (.cse5 ((_ zero_extend 24) c_~var_1_4~0))) (let ((.cse3 (bvsgt .cse4 .cse5))) (or (and .cse3 (= ((_ extract 15 0) .cse4) c_~var_1_20~0)) (and (= ((_ extract 15 0) .cse5) c_~var_1_20~0) (not .cse3))))) (= (_ bv0 16) c_~var_1_21~0) (fp.leq c_~var_1_12~0 .cse7) (fp.geq c_~var_1_14~0 .cse1) (bvsle .cse0 (_ bv31 32)) (fp.leq c_~var_1_14~0 .cse7) (fp.geq c_~var_1_13~0 .cse1) (fp.geq c_~var_1_12~0 .cse1) (fp.leq c_~var_1_13~0 .cse7) (fp.leq c_~var_1_10~0 .cse7) (bvsge .cse8 (_ bv4294967233 32)) (let ((.cse9 (bvslt .cse0 (_ bv0 32)))) (or (and (= c_~var_1_16~0 ((_ extract 7 0) (bvadd .cse0 .cse8 .cse2))) (not .cse9)) (and (= ((_ extract 7 0) (bvadd .cse8 .cse2 (bvneg .cse0))) c_~var_1_16~0) .cse9))) (let ((.cse10 (fp.gt c_~var_1_10~0 c_~var_1_11~0)) (.cse11 (fp.sub c_currentRoundingMode c_~var_1_13~0 c_~var_1_14~0))) (or (and .cse10 (= c_~var_1_8~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_10~0 c_~var_1_12~0) .cse11))) (and (not .cse10) (= c_~var_1_8~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_11~0 c_~var_1_12~0) .cse11))))) (fp.leq c_~var_1_11~0 .cse7) (fp.geq c_~var_1_11~0 .cse1) (let ((.cse12 ((_ sign_extend 24) c_~var_1_16~0))) (let ((.cse13 (bvslt .cse12 (_ bv0 32)))) (or (and (= c_~var_1_1~0 (bvneg .cse12)) .cse13) (and (not .cse13) (= .cse12 c_~var_1_1~0))))) (bvslt (_ bv64 32) (bvsrem .cse6 c_~var_1_9~0)) (not (bvsgt (_ bv32 32) c_~var_1_9~0)) (bvsle .cse8 (_ bv63 32)) (= c_~var_1_3~0 (_ bv64 8)) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv10 16) c_~var_1_6~0) (= (_ bv0 16) c_~last_1_var_1_21~0) (bvsge .cse2 (_ bv4294967265 32)))) is different from false [2024-11-08 19:09:30,609 WARN L286 SmtUtils]: Spent 7.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:09:38,812 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:09:46,904 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:09:55,063 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:10:03,190 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:10:11,292 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:10:19,408 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:10:27,591 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:10:34,428 WARN L286 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:10:42,545 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:10:50,693 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:10:58,822 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:11:06,927 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:11:15,025 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:11:23,170 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:11:31,272 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:11:39,368 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:11:47,463 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:11:53,211 WARN L286 SmtUtils]: Spent 5.75s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:12:02,424 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:12:10,560 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:12:18,691 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:12:26,796 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)