./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 ebfa0983e777f747b35ddf51685eed4bd631311b5aad9e37cee1c56108195d95 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:52:09,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:52:09,433 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:52:09,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:52:09,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:52:09,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:52:09,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:52:09,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:52:09,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:52:09,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:52:09,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:52:09,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:52:09,477 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:52:09,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:52:09,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:52:09,479 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:52:09,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:52:09,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:52:09,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:52:09,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:52:09,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:52:09,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:52:09,482 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:52:09,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:52:09,483 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:52:09,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:52:09,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:52:09,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:52:09,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:52:09,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:52:09,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:52:09,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:52:09,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:52:09,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:52:09,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:52:09,489 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:52:09,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:52:09,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:52:09,492 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:52:09,492 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_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/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_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> ebfa0983e777f747b35ddf51685eed4bd631311b5aad9e37cee1c56108195d95 [2023-11-06 22:52:09,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:52:09,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:52:09,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:52:09,830 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:52:09,831 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:52:09,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i [2023-11-06 22:52:13,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:52:13,499 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:52:13,501 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i [2023-11-06 22:52:13,511 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/data/b84a614bf/b1bf383ed7ee4015b3d4da71d59dc72c/FLAG26587c227 [2023-11-06 22:52:13,529 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/data/b84a614bf/b1bf383ed7ee4015b3d4da71d59dc72c [2023-11-06 22:52:13,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:52:13,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:52:13,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:52:13,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:52:13,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:52:13,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:52:13" (1/1) ... [2023-11-06 22:52:13,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d39a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:13, skipping insertion in model container [2023-11-06 22:52:13,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:52:13" (1/1) ... [2023-11-06 22:52:13,594 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:52:13,796 WARN L240 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_cea457b1-b617-4e99-9a35-b12c7b50f18d/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i[917,930] [2023-11-06 22:52:13,855 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:52:13,876 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:52:13,896 WARN L240 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_cea457b1-b617-4e99-9a35-b12c7b50f18d/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i[917,930] [2023-11-06 22:52:13,928 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:52:13,947 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:52:13,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:13 WrapperNode [2023-11-06 22:52:13,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:52:13,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:52:13,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:52:13,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:52:13,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:13" (1/1) ... [2023-11-06 22:52:13,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:13" (1/1) ... [2023-11-06 22:52:14,018 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2023-11-06 22:52:14,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:52:14,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:52:14,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:52:14,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:52:14,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:13" (1/1) ... [2023-11-06 22:52:14,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:13" (1/1) ... [2023-11-06 22:52:14,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:13" (1/1) ... [2023-11-06 22:52:14,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:13" (1/1) ... [2023-11-06 22:52:14,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:13" (1/1) ... [2023-11-06 22:52:14,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:13" (1/1) ... [2023-11-06 22:52:14,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:13" (1/1) ... [2023-11-06 22:52:14,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:13" (1/1) ... [2023-11-06 22:52:14,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:52:14,083 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:52:14,083 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:52:14,083 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:52:14,084 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:13" (1/1) ... [2023-11-06 22:52:14,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:52:14,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:14,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:52:14,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:52:14,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:52:14,181 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:52:14,181 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:52:14,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:52:14,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:52:14,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:52:14,343 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:52:14,346 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:52:14,882 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:52:14,898 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:52:14,898 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:52:14,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:14 BoogieIcfgContainer [2023-11-06 22:52:14,901 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:52:14,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:52:14,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:52:14,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:52:14,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:52:13" (1/3) ... [2023-11-06 22:52:14,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e70e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:52:14, skipping insertion in model container [2023-11-06 22:52:14,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:13" (2/3) ... [2023-11-06 22:52:14,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e70e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:52:14, skipping insertion in model container [2023-11-06 22:52:14,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:14" (3/3) ... [2023-11-06 22:52:14,914 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-70.i [2023-11-06 22:52:14,940 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:52:14,940 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:52:15,035 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:52:15,042 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@338e762a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:52:15,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:52:15,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:52:15,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-06 22:52:15,061 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:15,062 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:15,063 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:15,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:15,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2070141142, now seen corresponding path program 1 times [2023-11-06 22:52:15,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:15,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126792639] [2023-11-06 22:52:15,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:15,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:15,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:52:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:15,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:15,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:15,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:52:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:15,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:52:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:15,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:52:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:15,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:52:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:15,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:52:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:15,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:52:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:15,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:52:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:15,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:52:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:15,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:52:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:52:15,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:15,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126792639] [2023-11-06 22:52:15,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126792639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:15,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:15,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:52:15,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34938337] [2023-11-06 22:52:15,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:15,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:52:15,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:15,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:52:15,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:52:15,536 INFO L87 Difference]: Start difference. First operand has 56 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:52:15,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:15,582 INFO L93 Difference]: Finished difference Result 105 states and 168 transitions. [2023-11-06 22:52:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:52:15,585 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2023-11-06 22:52:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:15,597 INFO L225 Difference]: With dead ends: 105 [2023-11-06 22:52:15,598 INFO L226 Difference]: Without dead ends: 52 [2023-11-06 22:52:15,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:52:15,606 INFO L413 NwaCegarLoop]: 74 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, 74 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 [2023-11-06 22:52:15,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:52:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-06 22:52:15,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-06 22:52:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:52:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2023-11-06 22:52:15,668 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 87 [2023-11-06 22:52:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:15,669 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2023-11-06 22:52:15,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:52:15,670 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2023-11-06 22:52:15,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-06 22:52:15,678 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:15,678 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:15,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:52:15,680 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:15,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:15,681 INFO L85 PathProgramCache]: Analyzing trace with hash -14104370, now seen corresponding path program 1 times [2023-11-06 22:52:15,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:15,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436725675] [2023-11-06 22:52:15,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:15,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:52:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:52:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:52:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:52:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:52:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:52:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:52:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:52:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:52:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:52:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:52:16,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:16,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436725675] [2023-11-06 22:52:16,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436725675] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:16,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:16,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:52:16,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985121215] [2023-11-06 22:52:16,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:16,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:52:16,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:16,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:52:16,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:16,183 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:52:16,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:16,275 INFO L93 Difference]: Finished difference Result 101 states and 145 transitions. [2023-11-06 22:52:16,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:52:16,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2023-11-06 22:52:16,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:16,281 INFO L225 Difference]: With dead ends: 101 [2023-11-06 22:52:16,281 INFO L226 Difference]: Without dead ends: 52 [2023-11-06 22:52:16,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:16,289 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:16,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 117 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:52:16,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-06 22:52:16,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-06 22:52:16,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:52:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions. [2023-11-06 22:52:16,305 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 73 transitions. Word has length 87 [2023-11-06 22:52:16,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:16,307 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 73 transitions. [2023-11-06 22:52:16,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:52:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 73 transitions. [2023-11-06 22:52:16,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 22:52:16,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:16,311 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:16,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:52:16,312 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:16,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:16,312 INFO L85 PathProgramCache]: Analyzing trace with hash -139494294, now seen corresponding path program 1 times [2023-11-06 22:52:16,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:16,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521599895] [2023-11-06 22:52:16,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:16,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:52:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:52:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:52:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:52:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:52:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:52:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:52:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:52:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:52:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:52:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:52:16,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:16,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521599895] [2023-11-06 22:52:16,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521599895] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:16,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:16,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:52:16,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253075964] [2023-11-06 22:52:16,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:16,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:52:16,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:16,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:52:16,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:16,566 INFO L87 Difference]: Start difference. First operand 52 states and 73 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:52:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:16,724 INFO L93 Difference]: Finished difference Result 146 states and 206 transitions. [2023-11-06 22:52:16,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:52:16,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2023-11-06 22:52:16,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:16,732 INFO L225 Difference]: With dead ends: 146 [2023-11-06 22:52:16,732 INFO L226 Difference]: Without dead ends: 97 [2023-11-06 22:52:16,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:16,737 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 58 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:16,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 147 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:52:16,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-06 22:52:16,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 63. [2023-11-06 22:52:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:52:16,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2023-11-06 22:52:16,771 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 89 [2023-11-06 22:52:16,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:16,775 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2023-11-06 22:52:16,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:52:16,775 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2023-11-06 22:52:16,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 22:52:16,785 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:16,785 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:16,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:52:16,785 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:16,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:16,786 INFO L85 PathProgramCache]: Analyzing trace with hash -840558872, now seen corresponding path program 1 times [2023-11-06 22:52:16,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:16,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335406549] [2023-11-06 22:52:16,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:16,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:52:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:52:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:52:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:52:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:52:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:52:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:52:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:52:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:52:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:52:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:52:17,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:17,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335406549] [2023-11-06 22:52:17,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335406549] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:17,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:17,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:52:17,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577711961] [2023-11-06 22:52:17,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:17,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:52:17,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:17,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:52:17,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:52:17,835 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:52:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:18,625 INFO L93 Difference]: Finished difference Result 223 states and 310 transitions. [2023-11-06 22:52:18,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:52:18,626 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2023-11-06 22:52:18,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:18,629 INFO L225 Difference]: With dead ends: 223 [2023-11-06 22:52:18,630 INFO L226 Difference]: Without dead ends: 163 [2023-11-06 22:52:18,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:52:18,634 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 156 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:18,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 365 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:52:18,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-06 22:52:18,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 102. [2023-11-06 22:52:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 86 states have internal predecessors, (113), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:52:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2023-11-06 22:52:18,685 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 89 [2023-11-06 22:52:18,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:18,688 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2023-11-06 22:52:18,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:52:18,689 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2023-11-06 22:52:18,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 22:52:18,693 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:18,694 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:18,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:52:18,694 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:18,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:18,695 INFO L85 PathProgramCache]: Analyzing trace with hash -160500502, now seen corresponding path program 1 times [2023-11-06 22:52:18,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:18,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58112263] [2023-11-06 22:52:18,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:18,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:52:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:52:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:52:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:52:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:52:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:52:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:52:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:52:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:52:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:52:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,061 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:52:21,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:21,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58112263] [2023-11-06 22:52:21,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58112263] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:21,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:21,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:52:21,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131069090] [2023-11-06 22:52:21,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:21,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:52:21,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:21,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:52:21,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:52:21,068 INFO L87 Difference]: Start difference. First operand 102 states and 141 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:52:21,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:21,692 INFO L93 Difference]: Finished difference Result 237 states and 326 transitions. [2023-11-06 22:52:21,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:52:21,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2023-11-06 22:52:21,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:21,697 INFO L225 Difference]: With dead ends: 237 [2023-11-06 22:52:21,697 INFO L226 Difference]: Without dead ends: 138 [2023-11-06 22:52:21,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:52:21,706 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 74 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:21,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 199 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:52:21,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-06 22:52:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 102. [2023-11-06 22:52:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 86 states have internal predecessors, (111), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:52:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 139 transitions. [2023-11-06 22:52:21,730 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 139 transitions. Word has length 89 [2023-11-06 22:52:21,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:21,731 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 139 transitions. [2023-11-06 22:52:21,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:52:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 139 transitions. [2023-11-06 22:52:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 22:52:21,733 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:21,733 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:21,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:52:21,734 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:21,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:21,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2120422550, now seen corresponding path program 1 times [2023-11-06 22:52:21,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:21,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45425719] [2023-11-06 22:52:21,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:21,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:28,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:52:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:28,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:28,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:28,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:52:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:28,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:52:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:28,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:52:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:28,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:52:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:28,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:52:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:28,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:52:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:28,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:52:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:28,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:52:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:28,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:52:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:52:28,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:28,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45425719] [2023-11-06 22:52:28,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45425719] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:28,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:28,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:52:28,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318844353] [2023-11-06 22:52:28,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:28,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:52:28,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:28,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:52:28,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:52:28,916 INFO L87 Difference]: Start difference. First operand 102 states and 139 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:52:30,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:52:34,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:34,048 INFO L93 Difference]: Finished difference Result 235 states and 321 transitions. [2023-11-06 22:52:34,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:52:34,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2023-11-06 22:52:34,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:34,051 INFO L225 Difference]: With dead ends: 235 [2023-11-06 22:52:34,051 INFO L226 Difference]: Without dead ends: 136 [2023-11-06 22:52:34,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:52:34,053 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 28 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:34,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 229 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-06 22:52:34,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-06 22:52:34,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 120. [2023-11-06 22:52:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 104 states have internal predecessors, (135), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:52:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 163 transitions. [2023-11-06 22:52:34,071 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 163 transitions. Word has length 89 [2023-11-06 22:52:34,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:34,072 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 163 transitions. [2023-11-06 22:52:34,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:52:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 163 transitions. [2023-11-06 22:52:34,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 22:52:34,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:34,074 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:34,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:52:34,075 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:34,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:34,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1861627226, now seen corresponding path program 1 times [2023-11-06 22:52:34,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:34,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561173030] [2023-11-06 22:52:34,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:34,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:52:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:52:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:52:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:52:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:52:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:52:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:52:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:52:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:52:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:52:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:52:34,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:34,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561173030] [2023-11-06 22:52:34,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561173030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:34,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:34,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:52:34,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555427451] [2023-11-06 22:52:34,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:34,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:52:34,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:34,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:52:34,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:34,170 INFO L87 Difference]: Start difference. First operand 120 states and 163 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:52:34,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:34,208 INFO L93 Difference]: Finished difference Result 253 states and 343 transitions. [2023-11-06 22:52:34,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:52:34,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2023-11-06 22:52:34,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:34,211 INFO L225 Difference]: With dead ends: 253 [2023-11-06 22:52:34,212 INFO L226 Difference]: Without dead ends: 136 [2023-11-06 22:52:34,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:34,214 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 33 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:34,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 156 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:52:34,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-06 22:52:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 120. [2023-11-06 22:52:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 104 states have internal predecessors, (134), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:52:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 162 transitions. [2023-11-06 22:52:34,232 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 162 transitions. Word has length 89 [2023-11-06 22:52:34,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:34,232 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 162 transitions. [2023-11-06 22:52:34,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:52:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 162 transitions. [2023-11-06 22:52:34,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 22:52:34,235 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:34,235 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:34,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:52:34,235 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:34,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1153476392, now seen corresponding path program 1 times [2023-11-06 22:52:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:34,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826404] [2023-11-06 22:52:34,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:34,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:52:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:52:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:52:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:52:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:52:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:52:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:52:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:52:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:52:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:52:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:52:34,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:34,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826404] [2023-11-06 22:52:34,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:34,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:34,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:52:34,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562048361] [2023-11-06 22:52:34,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:34,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:52:34,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:34,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:52:34,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:52:34,478 INFO L87 Difference]: Start difference. First operand 120 states and 162 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:52:34,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:34,531 INFO L93 Difference]: Finished difference Result 253 states and 341 transitions. [2023-11-06 22:52:34,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:52:34,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2023-11-06 22:52:34,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:34,534 INFO L225 Difference]: With dead ends: 253 [2023-11-06 22:52:34,534 INFO L226 Difference]: Without dead ends: 136 [2023-11-06 22:52:34,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:52:34,536 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 30 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:34,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 236 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:52:34,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-06 22:52:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 102. [2023-11-06 22:52:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 86 states have internal predecessors, (108), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:52:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 136 transitions. [2023-11-06 22:52:34,557 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 136 transitions. Word has length 89 [2023-11-06 22:52:34,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:34,559 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 136 transitions. [2023-11-06 22:52:34,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:52:34,559 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 136 transitions. [2023-11-06 22:52:34,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-06 22:52:34,561 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:34,561 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:34,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:52:34,561 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:34,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1483177367, now seen corresponding path program 1 times [2023-11-06 22:52:34,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:34,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791075514] [2023-11-06 22:52:34,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:34,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:52:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:52:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:52:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:52:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:52:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:52:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:52:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:52:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:52:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:52:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:34,664 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:52:34,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:34,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791075514] [2023-11-06 22:52:34,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791075514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:34,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:34,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:52:34,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874429291] [2023-11-06 22:52:34,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:34,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:52:34,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:34,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:52:34,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:34,668 INFO L87 Difference]: Start difference. First operand 102 states and 136 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:52:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:34,716 INFO L93 Difference]: Finished difference Result 201 states and 269 transitions. [2023-11-06 22:52:34,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:52:34,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 92 [2023-11-06 22:52:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:34,718 INFO L225 Difference]: With dead ends: 201 [2023-11-06 22:52:34,718 INFO L226 Difference]: Without dead ends: 102 [2023-11-06 22:52:34,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:34,721 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 5 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:34,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 113 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:52:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-06 22:52:34,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-06 22:52:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.223529411764706) internal successors, (104), 86 states have internal predecessors, (104), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:52:34,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 132 transitions. [2023-11-06 22:52:34,740 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 132 transitions. Word has length 92 [2023-11-06 22:52:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:34,740 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 132 transitions. [2023-11-06 22:52:34,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:52:34,741 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 132 transitions. [2023-11-06 22:52:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-06 22:52:34,742 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:34,743 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:34,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:52:34,743 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:34,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:34,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1682407153, now seen corresponding path program 1 times [2023-11-06 22:52:34,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:34,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416911890] [2023-11-06 22:52:34,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:34,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:35,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:52:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:35,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:35,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:35,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:52:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:35,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:52:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:35,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:52:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:35,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:52:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:35,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:52:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:35,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:52:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:35,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:52:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:35,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:52:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:35,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:52:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-11-06 22:52:35,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:35,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416911890] [2023-11-06 22:52:35,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416911890] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:35,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246683533] [2023-11-06 22:52:35,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:35,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:35,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:35,249 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:52:35,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:52:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:35,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:52:35,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-11-06 22:52:35,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:52:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-11-06 22:52:36,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246683533] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:52:36,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:52:36,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 14 [2023-11-06 22:52:36,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287983303] [2023-11-06 22:52:36,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:52:36,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:52:36,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:36,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:52:36,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:52:36,767 INFO L87 Difference]: Start difference. First operand 102 states and 132 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2023-11-06 22:52:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:38,478 INFO L93 Difference]: Finished difference Result 261 states and 323 transitions. [2023-11-06 22:52:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:52:38,480 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 94 [2023-11-06 22:52:38,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:38,481 INFO L225 Difference]: With dead ends: 261 [2023-11-06 22:52:38,481 INFO L226 Difference]: Without dead ends: 156 [2023-11-06 22:52:38,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2023-11-06 22:52:38,483 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 404 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:38,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 271 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:52:38,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-06 22:52:38,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 106. [2023-11-06 22:52:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 89 states have internal predecessors, (103), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:52:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2023-11-06 22:52:38,501 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 94 [2023-11-06 22:52:38,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:38,502 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2023-11-06 22:52:38,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2023-11-06 22:52:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2023-11-06 22:52:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-06 22:52:38,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:38,506 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:38,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:52:38,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:38,714 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:38,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:38,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1875875953, now seen corresponding path program 1 times [2023-11-06 22:52:38,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:38,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31605559] [2023-11-06 22:52:38,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:38,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:39,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:52:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:39,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:52:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:39,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:39,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:52:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:39,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:52:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:39,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:52:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:39,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:52:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:39,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:52:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:39,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:52:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:39,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:52:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:39,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:52:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:39,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:52:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-11-06 22:52:39,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:39,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31605559] [2023-11-06 22:52:39,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31605559] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:39,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211938598] [2023-11-06 22:52:39,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:39,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:39,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:39,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:52:39,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:52:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:39,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:52:39,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-06 22:52:39,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:52:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-11-06 22:52:39,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211938598] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:52:39,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:52:39,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2023-11-06 22:52:39,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943821870] [2023-11-06 22:52:39,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:52:39,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-06 22:52:39,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:39,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-06 22:52:39,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:52:39,903 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2023-11-06 22:52:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:40,874 INFO L93 Difference]: Finished difference Result 240 states and 289 transitions. [2023-11-06 22:52:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:52:40,875 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 94 [2023-11-06 22:52:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:40,878 INFO L225 Difference]: With dead ends: 240 [2023-11-06 22:52:40,878 INFO L226 Difference]: Without dead ends: 137 [2023-11-06 22:52:40,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=1101, Unknown=0, NotChecked=0, Total=1406 [2023-11-06 22:52:40,881 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 386 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:40,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 230 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:52:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-06 22:52:40,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 101. [2023-11-06 22:52:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.146341463414634) internal successors, (94), 83 states have internal predecessors, (94), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:52:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2023-11-06 22:52:40,907 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 122 transitions. Word has length 94 [2023-11-06 22:52:40,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:40,908 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 122 transitions. [2023-11-06 22:52:40,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2023-11-06 22:52:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 122 transitions. [2023-11-06 22:52:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-06 22:52:40,909 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:40,910 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:40,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:52:41,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:41,116 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:41,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:41,117 INFO L85 PathProgramCache]: Analyzing trace with hash 864758703, now seen corresponding path program 1 times [2023-11-06 22:52:41,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:41,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261102425] [2023-11-06 22:52:41,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:41,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:52:41,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:52:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:52:41,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:52:41,288 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:52:41,290 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:52:41,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:52:41,296 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:41,301 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:52:41,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:52:41 BoogieIcfgContainer [2023-11-06 22:52:41,435 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:52:41,436 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:52:41,436 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:52:41,437 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:52:41,437 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:14" (3/4) ... [2023-11-06 22:52:41,440 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:52:41,441 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:52:41,442 INFO L158 Benchmark]: Toolchain (without parser) took 27907.25ms. Allocated memory was 165.7MB in the beginning and 257.9MB in the end (delta: 92.3MB). Free memory was 130.2MB in the beginning and 173.1MB in the end (delta: -42.9MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. [2023-11-06 22:52:41,443 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 104.9MB. Free memory is still 54.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:52:41,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.79ms. Allocated memory is still 165.7MB. Free memory was 129.8MB in the beginning and 117.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:52:41,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.90ms. Allocated memory is still 165.7MB. Free memory was 117.2MB in the beginning and 114.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:52:41,444 INFO L158 Benchmark]: Boogie Preprocessor took 62.79ms. Allocated memory is still 165.7MB. Free memory was 114.3MB in the beginning and 112.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:52:41,445 INFO L158 Benchmark]: RCFGBuilder took 818.53ms. Allocated memory is still 165.7MB. Free memory was 112.7MB in the beginning and 95.0MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 22:52:41,446 INFO L158 Benchmark]: TraceAbstraction took 26530.97ms. Allocated memory was 165.7MB in the beginning and 257.9MB in the end (delta: 92.3MB). Free memory was 94.6MB in the beginning and 173.1MB in the end (delta: -78.5MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2023-11-06 22:52:41,446 INFO L158 Benchmark]: Witness Printer took 5.33ms. Allocated memory is still 257.9MB. Free memory is still 173.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:52:41,448 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 104.9MB. Free memory is still 54.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.79ms. Allocated memory is still 165.7MB. Free memory was 129.8MB in the beginning and 117.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.90ms. Allocated memory is still 165.7MB. Free memory was 117.2MB in the beginning and 114.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.79ms. Allocated memory is still 165.7MB. Free memory was 114.3MB in the beginning and 112.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 818.53ms. Allocated memory is still 165.7MB. Free memory was 112.7MB in the beginning and 95.0MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 26530.97ms. Allocated memory was 165.7MB in the beginning and 257.9MB in the end (delta: 92.3MB). Free memory was 94.6MB in the beginning and 173.1MB in the end (delta: -78.5MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Witness Printer took 5.33ms. Allocated memory is still 257.9MB. Free memory is still 173.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 85, overapproximation of someBinaryArithmeticDOUBLEoperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_4 = 19138; [L25] signed char var_1_6 = 25; [L26] signed long int var_1_7 = -50; [L27] double var_1_8 = 8.3; [L28] double var_1_9 = 255.6; [L29] double var_1_10 = 10000000.375; [L30] double var_1_11 = 0.0; [L31] double var_1_12 = 255.375; [L32] unsigned char var_1_13 = 50; [L33] unsigned char var_1_14 = 2; [L34] signed char var_1_15 = 1; [L35] signed char var_1_16 = 5; VAL [isInitial=0, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L89] isInitial = 1 [L90] FCALL initially() [L91] COND TRUE 1 [L92] FCALL updateLastVariables() [L93] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L64] var_1_4 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L65] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L66] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L66] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L67] var_1_9 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L68] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L69] var_1_10 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=10000005, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=10000005, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L70] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=10000005, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L72] RET assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L73] var_1_12 = __VERIFIER_nondet_double() [L74] 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, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L74] 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, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L75] var_1_14 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L76] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L77] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L77] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L78] var_1_16 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L79] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L80] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L80] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L93] RET updateVariables() [L94] CALL step() [L39] var_1_13 = var_1_14 [L40] var_1_15 = var_1_16 VAL [isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)) VAL [isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=47138, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L44] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) VAL [isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=47138, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L47] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=32767, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=47138, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=32767, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13 << var_1_13=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=47138, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=32767, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13 << var_1_13=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=47138, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=32767, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13 << var_1_13=0, var_1_13 << var_1_13=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=47138, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))=0, isInitial=1, stepLocal_0=32767, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13 << var_1_13=0, var_1_13 << var_1_13=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=47138, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=10000008] [L48] COND FALSE !(stepLocal_0 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) [L51] var_1_7 = (var_1_13 + (var_1_1 + var_1_4)) VAL [isInitial=1, stepLocal_0=32767, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=47138, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=79905, var_1_8=83/10, var_1_9=10000008] [L53] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, stepLocal_0=32767, stepLocal_1=0, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=47138, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=79905, var_1_8=83/10, var_1_9=10000008] [L54] COND FALSE !(var_1_13 < stepLocal_1) [L57] var_1_8 = ((var_1_11 - var_1_12) - var_1_9) VAL [isInitial=1, stepLocal_0=32767, stepLocal_1=0, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=47138, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=79905, var_1_9=10000008] [L94] RET step() [L95] CALL, EXPR property() [L85] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))=1, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=47138, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=79905, var_1_9=10000008] [L85] EXPR var_1_13 << var_1_13 VAL [((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))=1, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13 << var_1_13=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=47138, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=79905, var_1_9=10000008] [L85] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))=1, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13 << var_1_13=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=47138, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=79905, var_1_9=10000008] [L85] EXPR var_1_13 << var_1_13 VAL [((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))=1, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13 << var_1_13=0, var_1_13 << var_1_13=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=47138, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=79905, var_1_9=10000008] [L85] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))=0, ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))=1, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13 << var_1_13=0, var_1_13 << var_1_13=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=47138, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=79905, var_1_9=10000008] [L85] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))=0, ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))=1, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13 << var_1_13=0, var_1_13 << var_1_13=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=47138, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=79905, var_1_9=10000008] [L85-L86] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))) && ((var_1_13 < var_1_13) ? (var_1_8 == ((double) (var_1_9 - var_1_10))) : (var_1_8 == ((double) ((var_1_11 - var_1_12) - var_1_9))))) && (var_1_13 == ((unsigned char) var_1_14))) && (var_1_15 == ((signed char) var_1_16)) ; [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=47138, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=79905, var_1_9=10000008] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=10000005, var_1_11=10000007, var_1_12=10000006, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=47138, var_1_2=1, var_1_4=32767, var_1_6=25, var_1_7=79905, var_1_9=10000008] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.3s, OverallIterations: 12, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1192 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1178 mSDsluCounter, 2137 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1315 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1382 IncrementalHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 822 mSDtfsCounter, 1382 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 753 GetRequests, 659 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=6, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 283 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 1270 NumberOfCodeBlocks, 1270 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1349 ConstructedInterpolants, 0 QuantifiedInterpolants, 6748 SizeOfPredicates, 9 NumberOfNonLiveVariables, 471 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 3807/3960 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 [2023-11-06 22:52:41,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 ebfa0983e777f747b35ddf51685eed4bd631311b5aad9e37cee1c56108195d95 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:52:44,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:52:44,669 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:52:44,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:52:44,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:52:44,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:52:44,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:52:44,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:52:44,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:52:44,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:52:44,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:52:44,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:52:44,747 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:52:44,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:52:44,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:52:44,750 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:52:44,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:52:44,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:52:44,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:52:44,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:52:44,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:52:44,755 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:52:44,756 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:52:44,756 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:52:44,757 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:52:44,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:52:44,758 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:52:44,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:52:44,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:52:44,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:52:44,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:52:44,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:52:44,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:52:44,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:52:44,763 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:52:44,763 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:52:44,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:52:44,764 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:52:44,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:52:44,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:52:44,766 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:52:44,766 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:52:44,767 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_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/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_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> ebfa0983e777f747b35ddf51685eed4bd631311b5aad9e37cee1c56108195d95 [2023-11-06 22:52:45,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:52:45,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:52:45,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:52:45,233 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:52:45,236 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:52:45,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i [2023-11-06 22:52:48,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:52:48,916 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:52:48,918 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i [2023-11-06 22:52:48,935 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/data/10d8e1555/17f561205dda4fccb77aee32f7c427c2/FLAG950700b65 [2023-11-06 22:52:48,954 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/data/10d8e1555/17f561205dda4fccb77aee32f7c427c2 [2023-11-06 22:52:48,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:52:48,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:52:48,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:52:48,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:52:48,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:52:48,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:52:48" (1/1) ... [2023-11-06 22:52:48,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f3b42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:48, skipping insertion in model container [2023-11-06 22:52:48,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:52:48" (1/1) ... [2023-11-06 22:52:49,003 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:52:49,202 WARN L240 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_cea457b1-b617-4e99-9a35-b12c7b50f18d/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i[917,930] [2023-11-06 22:52:49,256 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:52:49,297 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:52:49,325 WARN L240 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_cea457b1-b617-4e99-9a35-b12c7b50f18d/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i[917,930] [2023-11-06 22:52:49,390 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:52:49,419 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:52:49,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:49 WrapperNode [2023-11-06 22:52:49,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:52:49,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:52:49,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:52:49,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:52:49,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:49" (1/1) ... [2023-11-06 22:52:49,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:49" (1/1) ... [2023-11-06 22:52:49,511 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2023-11-06 22:52:49,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:52:49,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:52:49,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:52:49,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:52:49,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:49" (1/1) ... [2023-11-06 22:52:49,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:49" (1/1) ... [2023-11-06 22:52:49,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:49" (1/1) ... [2023-11-06 22:52:49,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:49" (1/1) ... [2023-11-06 22:52:49,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:49" (1/1) ... [2023-11-06 22:52:49,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:49" (1/1) ... [2023-11-06 22:52:49,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:49" (1/1) ... [2023-11-06 22:52:49,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:49" (1/1) ... [2023-11-06 22:52:49,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:52:49,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:52:49,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:52:49,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:52:49,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:49" (1/1) ... [2023-11-06 22:52:49,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:52:49,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:49,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:52:49,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:52:49,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:52:49,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:52:49,713 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:52:49,714 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:52:49,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:52:49,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:52:49,862 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:52:49,865 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:52:51,539 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:52:51,546 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:52:51,547 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:52:51,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:51 BoogieIcfgContainer [2023-11-06 22:52:51,550 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:52:51,554 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:52:51,554 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:52:51,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:52:51,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:52:48" (1/3) ... [2023-11-06 22:52:51,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b963c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:52:51, skipping insertion in model container [2023-11-06 22:52:51,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:49" (2/3) ... [2023-11-06 22:52:51,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b963c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:52:51, skipping insertion in model container [2023-11-06 22:52:51,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:51" (3/3) ... [2023-11-06 22:52:51,562 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-70.i [2023-11-06 22:52:51,591 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:52:51,591 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:52:51,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:52:51,674 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@576b2f0a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:52:51,674 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:52:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:52:51,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-06 22:52:51,695 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:51,696 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:51,696 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:51,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:51,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1062525254, now seen corresponding path program 1 times [2023-11-06 22:52:51,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:52:51,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082104353] [2023-11-06 22:52:51,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:51,726 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 [2023-11-06 22:52:51,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:52:51,727 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 22:52:51,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:52:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:52,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:52:52,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2023-11-06 22:52:52,327 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:52:52,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:52:52,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082104353] [2023-11-06 22:52:52,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082104353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:52,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:52,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:52:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126273963] [2023-11-06 22:52:52,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:52,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:52:52,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:52:52,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:52:52,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:52:52,417 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:52:52,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:52,480 INFO L93 Difference]: Finished difference Result 83 states and 132 transitions. [2023-11-06 22:52:52,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:52:52,483 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2023-11-06 22:52:52,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:52,496 INFO L225 Difference]: With dead ends: 83 [2023-11-06 22:52:52,496 INFO L226 Difference]: Without dead ends: 41 [2023-11-06 22:52:52,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:52:52,507 INFO L413 NwaCegarLoop]: 56 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, 56 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 [2023-11-06 22:52:52,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:52:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-06 22:52:52,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-06 22:52:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:52:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2023-11-06 22:52:52,571 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 83 [2023-11-06 22:52:52,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:52,572 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2023-11-06 22:52:52,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:52:52,573 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2023-11-06 22:52:52,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-06 22:52:52,578 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:52,579 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:52,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:52:52,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:52:52,781 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:52,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:52,782 INFO L85 PathProgramCache]: Analyzing trace with hash 960529726, now seen corresponding path program 1 times [2023-11-06 22:52:52,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:52:52,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640028862] [2023-11-06 22:52:52,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:52,783 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 [2023-11-06 22:52:52,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:52:52,785 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 22:52:52,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:52:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:53,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:52:53,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:52:53,337 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:52:53,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:52:53,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640028862] [2023-11-06 22:52:53,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640028862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:53,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:53,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:52:53,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559342594] [2023-11-06 22:52:53,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:53,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:52:53,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:52:53,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:52:53,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:53,345 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:52:55,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:52:56,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:52:56,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:56,663 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2023-11-06 22:52:56,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:52:56,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2023-11-06 22:52:56,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:56,682 INFO L225 Difference]: With dead ends: 79 [2023-11-06 22:52:56,682 INFO L226 Difference]: Without dead ends: 41 [2023-11-06 22:52:56,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:56,685 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:56,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-06 22:52:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-06 22:52:56,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-06 22:52:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:52:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2023-11-06 22:52:56,699 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 83 [2023-11-06 22:52:56,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:56,702 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2023-11-06 22:52:56,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:52:56,702 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2023-11-06 22:52:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-06 22:52:56,705 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:56,705 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:56,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:52:56,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:52:56,906 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:56,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:56,907 INFO L85 PathProgramCache]: Analyzing trace with hash 962376768, now seen corresponding path program 1 times [2023-11-06 22:52:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:52:56,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194833201] [2023-11-06 22:52:56,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:56,909 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 [2023-11-06 22:52:56,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:52:56,911 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 22:52:56,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:52:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:57,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:52:57,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 48 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-11-06 22:52:57,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:52:58,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:52:58,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194833201] [2023-11-06 22:52:58,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194833201] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:58,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1591643726] [2023-11-06 22:52:58,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:58,461 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-06 22:52:58,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/cvc4 [2023-11-06 22:52:58,464 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-06 22:52:58,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-11-06 22:52:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:59,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:52:59,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 48 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-11-06 22:53:00,355 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:00,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1591643726] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:00,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:53:00,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-11-06 22:53:00,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166853784] [2023-11-06 22:53:00,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:53:00,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:53:00,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:53:00,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:53:00,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:53:00,636 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:53:03,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:53:04,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:04,442 INFO L93 Difference]: Finished difference Result 111 states and 140 transitions. [2023-11-06 22:53:04,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:53:04,444 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 83 [2023-11-06 22:53:04,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:04,446 INFO L225 Difference]: With dead ends: 111 [2023-11-06 22:53:04,447 INFO L226 Difference]: Without dead ends: 73 [2023-11-06 22:53:04,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:53:04,453 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 91 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:04,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 141 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-06 22:53:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-06 22:53:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2023-11-06 22:53:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.127659574468085) internal successors, (53), 48 states have internal predecessors, (53), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:53:04,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2023-11-06 22:53:04,477 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 83 [2023-11-06 22:53:04,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:04,478 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2023-11-06 22:53:04,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:53:04,478 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2023-11-06 22:53:04,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-06 22:53:04,480 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:04,480 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:04,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:53:04,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:04,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt [2023-11-06 22:53:04,897 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:04,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:04,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1642435138, now seen corresponding path program 1 times [2023-11-06 22:53:04,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:53:04,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912958694] [2023-11-06 22:53:04,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:04,899 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 [2023-11-06 22:53:04,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:53:04,902 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 22:53:04,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea457b1-b617-4e99-9a35-b12c7b50f18d/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:53:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:05,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-06 22:53:05,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:54:12,696 WARN L293 SmtUtils]: Spent 23.51s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)